Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 114 views

    Chapter 8: Deadlocks: System Model Deadlock Characterization Methods For Handling Deadlocks

    Uploaded by

    Anonymous nLUdTm
    (1) Deadlock occurs when a set of processes are waiting for resources held by each other in a cyclic manner. (2) Four conditions must be met simultaneously for deadlock to occur: mutual exclusion, hold and wait, no preemption, and circular wait. (3) A resource-allocation graph can model resource usage, with processes and resources as vertices and allocation as edges; a cycle implies deadlock.

    Copyright:

    © All Rights Reserved

    Chapter 8: Deadlocks: System Model Deadlock Characterization Methods For Handling Deadlocks

    Uploaded by

    Anonymous nLUdTm
    114 views12 pages
    (1) Deadlock occurs when a set of processes are waiting for resources held by each other in a cyclic manner. (2) Four conditions must be met simultaneously for deadlock to occur: mutual exclusion, hold and wait, no preemption, and circular wait. (3) A resource-allocation graph can model resource usage, with processes and resources as vertices and allocation as edges; a cycle implies deadlock.

    Original Description:

    bauua sing

    Original Title

    ch_8_galvin

    Copyright

    © © All Rights Reserved

    Did you find this document useful?

    Is this content inappropriate?

    (1) Deadlock occurs when a set of processes are waiting for resources held by each other in a cyclic manner. (2) Four conditions must be met simultaneously for deadlock to occur: mutual exclusion, hold and wait, no preemption, and circular wait. (3) A resource-allocation graph can model resource usage, with processes and resources as vertices and allocation as edges; a cycle implies deadlock.

    Copyright:

    © All Rights Reserved
    114 views12 pages

    Chapter 8: Deadlocks: System Model Deadlock Characterization Methods For Handling Deadlocks

    Uploaded by

    Anonymous nLUdTm
    (1) Deadlock occurs when a set of processes are waiting for resources held by each other in a cyclic manner. (2) Four conditions must be met simultaneously for deadlock to occur: mutual exclusion, hold and wait, no preemption, and circular wait. (3) A resource-allocation graph can model resource usage, with processes and resources as vertices and allocation as edges; a cycle implies deadlock.

    Copyright:

    © All Rights Reserved
    You are on page 1of 12

    Chapter 8: Deadlocks

     System Model
     Deadlock Characterization
     Methods for Handling Deadlocks

    Operating System Concepts 8.1 Silberschatz, Galvin and Gagne 2002


    The Deadlock Problem
     A set of processes is in deadlock state when every process in
    the set is waiting for an event that can be caused only by
    another process in the set.
     Under normal mode of operation, a process utilize a resource in
    the following sequence:
     Request –If the request can not granted immediately, then
    the process has to wait until it can acquire the resource.Also
    the process is added to the waiting queue of the device.
     Use – The process can operate on the resource.
     Release – The process releases the resource.
     Resources may be physical resources(tape drives, memory
    space and CPU cycles ) or logical resources(semaphores, files)

    Operating System Concepts 8.2 Silberschatz, Galvin and Gagne 2002


    Example of deadlock
     Example- deadlock with same kind of device
     System has 2 tape drives.
     P1 and P2 each hold one tape drive and each needs
    another one.
     Example- deadlock with different device
     System has one tape drive and one printer.
     P1 is holding printer and P2 is holding tape drive.
     Now if P1 requests tape drive and P2 requests
    printer,system is in deadlock.
     Example of logical resource (semaphore)
     semaphores A and B, initialized to 1
    P0 P1
    wait (A); wait(B);
    wait (B); wait(A);
    Operating System Concepts 8.3 Silberschatz, Galvin and Gagne 2002
    Deadlock Characterization
    Deadlock can arise if four conditions hold simultaneously.

     Mutual exclusion: Only one process at a time can use a


    resource, so other requesting processes must wait.
     Hold and wait: A process holding at least one resource is
    waiting to acquire additional resources held by other
    processes.
     No preemption: A resource can be released only voluntarily
    by the process holding it, after that process has completed its
    task.
     Circular wait: There exists a set {P0, P1, …, Pn} of waiting
    processes such that P0 is waiting for a resource that is held
    by P1, P1 is waiting for a resource that is held by P2,……
    Pn-1 is waiting for a resource that is held by Pn, and Pn is
    waiting for a resource that is held by P0.
    Operating System Concepts 8.4 Silberschatz, Galvin and Gagne 2002
    Resource-Allocation Graph
    A set of vertices V and a set of edges E.
     V is partitioned into two types:
     P = {P1, P2, …, Pn}, the set consisting of all the
    processes in the system.

     R = {R1, R2, …, Rm}, the set consisting of all resource


    types in the system.
     request edge – directed edge Pi  Rj
     assignment edge – directed edge Rj  Pi .
     When a resource is allocated to the process, the request
    edge is removed and assignment edge is added to the
    graph.

    Operating System Concepts 8.5 Silberschatz, Galvin and Gagne 2002


    Resource-Allocation Graph (Cont.)

     Process

     Resource Type with 4 instances

     Pi requests instance of Rj
    Pi
    Rjj
     Pi is holding an instance of Rj

    Pi
    Rj

    Operating System Concepts 8.6 Silberschatz, Galvin and Gagne 2002


    Example of a Resource Allocation Graph

    Operating System Concepts 8.7 Silberschatz, Galvin and Gagne 2002


     If each resource in the graph has exactly one instance of
    a resource then existence of cycle in the graph implies
    deadlock.
     But if multiple instances of a resource exist then
    occurrence of cycle does not necessarily imply that
    deadlock has occurred.
     So for single instance resource allocation, existence of
    cycle is necessary and sufficient condition for deadlock,
    whereas for multiple instance resources, occurrence of
    cycle is necessary but not sufficient condition for
    deadlock.

    Operating System Concepts 8.8 Silberschatz, Galvin and Gagne 2002


    Resource Allocation Graph With A Deadlock

    Operating System Concepts 8.9 Silberschatz, Galvin and Gagne 2002


    Resource Allocation Graph With A Cycle But No
    Deadlock

    Operating System Concepts 8.10 Silberschatz, Galvin and Gagne 2002


    Methods for Handling Deadlocks
    We can deal with deadlocks in one of the three ways:
     Ensure that the system will never enter a deadlock
    state(deadlock prevention & deadlock avoidance)
     Allow the system to enter a deadlock state and then
    recover(deadlock detection and recovery)
     Ignore the problem and pretend that deadlocks never occur
    in the system; used by most operating systems, including
    UNIX

    Operating System Concepts 8.11 Silberschatz, Galvin and Gagne 2002


     Deadlock Prevention – ensures that deadlock will never
    occur by making sure that one of the 4 conditions required
    for deadlock is not met.
     Deadlock Avoidance – requires that OS should know
    beforehand about the resource requirements of the
    processes.
    OS then makes sure before allocating resources to the
    processes that it does not allocate such that cycle exist in
    the resource allocation graph.

    Operating System Concepts 8.12 Silberschatz, Galvin and Gagne 2002

    You might also like