OS Organization Chapter 6 Part I: Principals of Deadlock William Stallings

Home > Preview

The flashcards below were created by user geschw66 on FreezingBlue Flashcards.


  1. Principals of Deadlock: Deadlock (defn):
    The permanent blocking of a set of processes that either complete for system resources or communicate with each other.
  2. Principals of Deadlock: A set of processes is deadlocked when each process in the set is blocked awaiting an event that can only be triggered by another ______.
    A. Blocked process in the set
    B. Unblocked process in the set
    C. A kernel level system call
    D. Interrupt
    E. None of the above
    A. Blocked process in the set
    (this multiple choice question has been scrambled)
  3. Principals of Deadlock: Joint Progress Diagram:

    Image Upload

    Path 1: O acquires B and then A and the releases B and A. When P resumes execution it will be able to to acquire both resources. (T/F)
    True.
  4. Principals of Deadlock: Joint Progress Diagram:

    Image Upload

    Path 3: Q acquires B and then P acquires A. Deadlock isnevitable, because as execution proceeds, ___________.

    A. Q will block on A and P will block on B.
    B. P will release A but P will not release A.
    C. P will block on A, and Q will release A.
    D. None of the the above.
    A. Q will block on A and P will block on B.
    (this multiple choice question has been scrambled)
  5. Principals of Deadlock: Joint Progress Diagram:Image Upload
    Path 4: P acquires A and then Q acquires B. Is deadlock inevitable, if so why?
    Yes.  because as execution proceeds, Q will block on A and P will block on B.
  6. Principals of Deadlock: In a joint progress diagram, what is the fatal region?
    if an execution path enter this fatal region then deadlock is inevitable. However, deadlock is only inevitable if the joint progress of the two processes creates a path that enters the fatal region.
  7. Principals of Deadlock: Two general categories of resources (?).

    A.  Reusable and Non-Reusable
    B. Consumable and Disposable
    C.  Reusable and Disposable
    D.  Reusable and Consumable
    E.   None of the Above
    D. Reusable and Consumable
    (this multiple choice question has been scrambled)
  8. Principals of Deadlock: Reusable Resource (defn'):
    is a resource that can be safely used by only one process at a time and is not depleted by that use. Processes obtain resource units that they later release for reuse by other processes.
  9. Principals of Deadlock: Reusable Resources: In the context of reusable resources, processes obtain resource units that they later release for reuse by other __________.

    A. processes.
    B. kernel processes.
    C. threads.
    D. little monkeys.
    E. None of the above.
    A. processes.
    (this multiple choice question has been scrambled)
  10. Principals of Deadlock: Consumable Resources (defn'):
    is a resource that can be created (produced) and destroyed(consumed).
  11. Principals of Deadlock: In the context of consumable resources, typically there is no limit on the number of consumable resources of a particular type. An unblocked producing process may create any number of such resources. (T/F)
    True
  12. Principals of Deadlock: In the context of reusable resources, what is the best way to deal with the problem of Process Q holding resource A until B is released, and process P holding resource B until A is released?

    A. imposing system design constraints concerning the order in which resources can be requested.
    B. eliminate the possibility  of deadlock by using virtual memory.
    C. calling a system level function to figure it out.
    D. None of the above.
    A. imposing system design constraints concerning the order in resources can be requested.
    (this multiple choice question has been scrambled)
  13. Principals of Deadlock: In the context of  reusable resources, what is the best way to handle requests for main memory?

    A. eliminate the possibility of deadlock by using virtual memory.
    B. imposing system design constraints concerning the order in which resources can be requested.
    C. calling a system level function to figure it out.
    D. None of the above.
    A. eliminate the possibility of deadlock by using virtual memory.
  14. Principals of Deadlock: Name some examples of consumable resources(?)
    • interrupts
    • signals
    • messages
    • info in I/O buffers.
  15. Principals of Deadlock: name some examples of reusable resources(?).
    • processesors
    • I/O channels
    • main memory
    • secondary or disk memory.
    • devices
    • data structures (ex. files, databases and semaphores)
  16. Principals of Deadlock: Name the 3 conditions of policy for deadlock to occur. Remember that these three conditions are necessary but not sufficient for a deadlock to exist.
    • Mutual Exclusion
    • Hold and Wait
    • No preemption
  17. Principals of Deadlock: Name the required condition for deadlock to occur (?)
    Circular wait.

Card Set Information

Author:
geschw66
ID:
319663
Filename:
OS Organization Chapter 6 Part I: Principals of Deadlock William Stallings
Updated:
2016-05-06 17:59:49
Tags:
OS OperatingSystems Computer
Folders:

Description:
Questions and Exercises based on the Operating System Organization class; Spring of 2016 at WUSTL.
Show Answers:

Home > Flashcards > Print Preview