Chapter 7: Deadlocks

Operating System Concepts – 8th Edition Silberschatz, Galvin and Gagne ©2009
 Chapter 7: Deadlocks
 The Deadlock Problem
 System Model
 Deadlock Characterization
 Methods for Handling Deadlocks
 Deadlock Prevention
 Deadlock Avoidance
 Deadlock Detection
 Recovery from Deadlock

Operating System Concepts – 8th Edition 7.2 Silberschatz, Galvin and Gagne ©2009
 Chapter Objectives
 To develop a description of deadlocks, which prevent sets of
concurrent processes from completing their tasks

 To present a number of different methods for preventing or avoiding

deadlocks in a computer system

Operating System Concepts – 8th Edition 7.3 Silberschatz, Galvin and Gagne ©2009
 The Deadlock Problem
 A set of blocked processes each holding a resource and waiting to
acquire a resource held by another process in the set

 Example
 System has 2 disk drives
 P1 and P2 each hold one disk drive and each needs another one

 Example

 semaphores A and B, initialized to 1

P0 P1
wait (A); wait(B)
wait (B); wait(A)

Operating System Concepts – 8th Edition 7.4 Silberschatz, Galvin and Gagne ©2009
 The Deadlock Problem
The Dining Philosophers problem …
All philosophers become hungry at the
same time, picked up the chopsticks on
their right and waited for getting the
chopsticks on their left.

Operating System Concepts – 8th Edition 7.5 Silberschatz, Galvin and Gagne ©2009
 Bridge Crossing Example

 Traffic only in one direction

 Each section of a bridge can be viewed as a resource
 If a deadlock occurs, it can be resolved if one car backs up
(preempt resources and rollback)
 Several cars may have to be backed up if a deadlock occurs
 Starvation is possible
 Note – Most OSes do not prevent or deal with deadlocks

Operating System Concepts – 8th Edition 7.6 Silberschatz, Galvin and Gagne ©2009
 System Model

 Resource types R1, R2, . . ., Rm

CPU cycles, memory space, I/O devices

 Each resource type Ri has Wi instances.

 Each process utilizes a resource as follows:

 Request
 Use
 Release

request → use → release

Operating System Concepts – 8th Edition 7.7 Silberschatz, Galvin and Gagne ©2009
 Deadlock Characterization

Deadlock can arise if four conditions hold simultaneously.

 Mutual exclusion: only one process at a time can use a
resource

 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.
P0 → P1 → P2 → … → Pn → P0

Operating System Concepts – 8th Edition 7.8 Silberschatz, Galvin and Gagne ©2009
 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

Operating System Concepts – 8th Edition 7.9 Silberschatz, Galvin and Gagne ©2009
 Resource-Allocation Graph (Cont.)
 Process

 Resource Type with 4 instances

 Pi requests instance of Rj Pi
Rj

 Pi is holding an instance of Rj Pi
Rj

Operating System Concepts – 8th Edition 7.10 Silberschatz, Galvin and Gagne ©2009
 Example of a Resource Allocation Graph

Process P1 is holding
an instance of resource
type R2 and is waiting
for an instance of
resource type R1.

Operating System Concepts – 8th Edition 7.11 Silberschatz, Galvin and Gagne ©2009
 Resource Allocation Graph With A Deadlock

P1, P2, and P3 are deadlocked!!

Operating System Concepts – 8th Edition 7.12 Silberschatz, Galvin and Gagne ©2009
 Graph With A Cycle But No Deadlock

Process P4 may release its instance of

resource type R2, breaking the cycle.
Operating System Concepts – 8th Edition 7.13 Silberschatz, Galvin and Gagne ©2009
 Basic Facts

 If graph contains no cycles  no deadlock

 If graph contains a cycle 

 if only one instance per resource type, then deadlock
 if several instances per resource type, possibility of deadlock

Operating System Concepts – 8th Edition 7.14 Silberschatz, Galvin and Gagne ©2009
 Deadlock Handling

 Deadlock Prevention
 Deadlock Avoidance
 Deadlock Detection and recovery

Operating System Concepts – 8th Edition 7.15 Silberschatz, Galvin and Gagne ©2009
 Deadlock Prevention
Restrain the ways request can be made to insure that at least one of the four
necessary conditions is violated.

 Mutual Exclusion – not required for sharable resources; must hold for non-
sharable resources.
Cannot be prevented for all resources. Some resources are inherently non-
sharable, such as a printer.

 Hold and Wait – must guarantee that whenever a process requests a resource,
it does not hold any other resources
 Require process to request and be allocated all its resources before it
begins execution, or allow process to request resources only when the
process has none
 Low resource utilization; starvation possible

Operating System Concepts – 8th Edition 7.16 Silberschatz, Galvin and Gagne ©2009
  Consider a process that copies data from
DVD drive to a file on disk, sorts the file, and
then prints the results to a printer.
 Protocol one:
 Require process to request and be allocated all its resources before
it begins execution.

 The process must initially request the DVD drive, disk file, and
printer.
 The printer will be held for the entire execution, even though it is
used at the end!!

Operating System Concepts – 8th Edition 7.17 Silberschatz, Galvin and Gagne ©2009
  Protocol two:
 Allow process to request resources only when the process has none.

 A process may request some resources and use them.

 Before it can request any additional resources, it must release all the
resources that it is currently allocated.

 The process first requests only the DVD drive and disk file.
– It copies from the DVD drive to the disk.
 It then releases both the DVD drive and the disk file. (none)
 And again request the disk file and the printer.
– Copying the disk file to the printer.
 Finally, it releases these two resources and terminates.

Operating System Concepts – 8th Edition 7.18 Silberschatz, Galvin and Gagne ©2009
 Deadlock Prevention (Cont.)
 No Preemption –
 If a process that is holding some resources requests another resource that cannot
be immediately allocated to it, then all resources currently being held are released
 Preempted resources are added to the list of resources for which the process is
waiting
 Process will be restarted only when it can regain its old resources, as well as the
new ones that it is requesting

 Protocol one:
 If a process that is holding some resources and requests another resource
that cannot be immediately allocated to it, then all resources currently being
held are preempted.
 Preempted resources are added to the list of resources for which the process
is waiting.
 Process will be restarted only when it can regain its old resources, as well as
the new ones that it is requesting.

Operating System Concepts – 8th Edition 7.19 Silberschatz, Galvin and Gagne ©2009
  Protocol two:
 If a process requests some resources, we first check whether they
are available.
 If they are, we allocate them.
 If not, we check whether they are allocated to some other process
that is waiting for additional resources.
 If so, we preempt the desired resources from the waiting process
and allocate them to the requesting process.

 If the resources are neither available nor held by a waiting process

(used by running processes), the requesting process must wait.
– When waiting, its resources may be preempted if another
process requests them.

Operating System Concepts – 8th Edition 7.20 Silberschatz, Galvin and Gagne ©2009
  Circular Wait – impose a total ordering of
all resource types, and require that each
process requests resources in an
increasing order of enumeration

Operating System Concepts – 8th Edition 7.21 Silberschatz, Galvin and Gagne ©2009
 Deadlock Prevention (Cont.)
 We assign a unique number to each resource type by using function
F: R → N
and make sure that processes request resources in an increasing
order of enumeration.
For example, tape drive = 1, disk drive = 5, and printer = 12.
 Proof
Let’s assume that there is a cycle
P0 → P 1 → P 2 → … → P k → P 0
R0 R1 R2 Rk R0
 F(R0) < F(R1) < … F(Rk) < F(R0)
 F(R0) < F(R0), which is impossible
 There can be no circular wait.

Operating System Concepts – 8th Edition 7.22 Silberschatz, Galvin and Gagne ©2009
 Deadlock Prevention (Cont.)

 A process can initially request any number of instances of a resource type –

say Ri.
 After that, the process can request instances of resource type Rj if and only
if F(Rj) > F(Ri).

So, there can be

 Proof :
(circular-wait condition cannot hold)
no circular wait!!
 Let the set of process processes involved in the circular wait be {P0, P1, …,
Pn}.
– Pi is waiting for a resource Ri, held by process Pi+1.
– Pn is waiting for a resource Rn held by P0.

 Since Pi+1 is holding Ri while requesting Ri+1, we have F(Ri) < F(Ri+1), for all i.

 Then, F(R0) < F(R1) < … < F(Rn)

< F(R0)

F(R0) < F(R0) … impossible

Operating System Concepts – 8th Edition 7.23 Silberschatz, Galvin and Gagne ©2009
 Deadlock Avoidance

Requires that the system has some additional a priori information

available about the use of resources by processes.

 Simplest and most useful model requires that each process declare
the maximum number of resources of each type that it may need

 The deadlock-avoidance algorithm dynamically examines the

resource-allocation state to ensure that there can never be a
circular-wait condition

 Resource-allocation state is defined by the number of available

and allocated resources, and the maximum demands of the
processes

Operating System Concepts – 8th Edition 7.24 Silberschatz, Galvin and Gagne ©2009
 Safe State

 When a process requests an available resource, system must decide if

immediate allocation leaves the system in a safe state
System is in safe state if there exists a safe sequence of all processes.
Sequence <P1, P2, …, Pn> is safe if for each Pi, the resources that Pi can
still request can be satisfied by the currently available resources, plus
the resources held by all the Pj, with j<i.
 In other words, a safe sequence specifies the order in which processes
can be finished.
 That is:
 If Pi resource needs are not immediately available, then Pi can wait
until all Pj have finished
 When Pj is finished, Pi can obtain needed resources, execute, return
allocated resources, and terminate
 When Pi terminates, Pi +1 can obtain its needed resources, and so on

Operating System Concepts – 8th Edition 7.25 Silberschatz, Galvin and Gagne ©2009
 Basic Facts

 If a system is in safe state  no deadlocks

 If a system is in unsafe state  possibility of deadlock

 Avoidance  ensure that a system will never enter an unsafe state.

Operating System Concepts – 8th Edition 7.26 Silberschatz, Galvin and Gagne ©2009
 Safe, Unsafe, Deadlock State

Operating System Concepts – 8th Edition 7.27 Silberschatz, Galvin and Gagne ©2009
 Example

 System with 12 tape drives and three processes

 Current system state:

Process Max Need Allocated

P0 10 5
P1 4 2
P2 9 2

 System is in a safe state with the safe sequence <P1, P0, P2>

Operating System Concepts – 8th Edition 7.28 Silberschatz, Galvin and Gagne ©2009
 Example
 P2 requests and is allocated one more tape drive.
 Assuming the tape drive is allocated to P2, the new system
state will be:

Process Max Need Allocated

P0 10 5
P1 4 2
P2 9 3

 System gets into an unsafe state

Operating System Concepts – 8th Edition 7.29 Silberschatz, Galvin and Gagne ©2009
 Avoidance algorithms

 Single instance of a resource type

 Use a resource-allocation graph

 Multiple instances of a resource type

 Use the banker’s algorithm

Operating System Concepts – 8th Edition 7.30 Silberschatz, Galvin and Gagne ©2009
 Resource-Allocation Graph (RAG)
Scheme

 Claim edge Pi  Rj indicated that process Pj may request resource

Rj; represented by a dashed line

 Claim edge converts to request edge when a process requests a

resource

 Request edge converted to an assignment edge when the resource

is allocated to the process

 When a resource is released by a process, assignment edge

reconverts to a claim edge

 Resources must be claimed a priori in the system

Operating System Concepts – 8th Edition 7.31 Silberschatz, Galvin and Gagne ©2009
 Resource-Allocation Graph (RAG)

Operating System Concepts – 8th Edition 7.32 Silberschatz, Galvin and Gagne ©2009
 Unsafe State In Resource-Allocation Graph

Operating System Concepts – 8th Edition 7.33 Silberschatz, Galvin and Gagne ©2009
 Resource-Allocation Graph Algorithm

 Suppose that process Pi requests a resource Rj

 The request can be granted only if converting the request edge to an

assignment edge does not result in the formation of a cycle in the
resource allocation graph

Operating System Concepts – 8th Edition 7.34 Silberschatz, Galvin and Gagne ©2009
 Banker’s Algorithm

 Multiple instances

 Each process must a priori claim maximum use

 When a process requests a resource it may have to wait

 When a process gets all its resources it must return them in a finite
amount of time

Operating System Concepts – 8th Edition 7.35 Silberschatz, Galvin and Gagne ©2009
 Data Structures for the Banker’s Algorithm

Let n = number of processes, and m = number of resources types.

 Available: Vector of length m. If available [j] = k, there are k
instances of resource type Rj available

 Max: n x m matrix. If Max [i,j] = k, then process Pi may request at

most k instances of resource type Rj

 Allocation: n x m matrix. If Allocation[i,j] = k then Pi is currently

allocated k instances of Rj

 Need: n x m matrix. If Need[i,j] = k, then Pi may need k more

instances of Rj to complete its task

Need [i,j] = Max[i,j] – Allocation [i,j]

Operating System Concepts – 8th Edition 7.36 Silberschatz, Galvin and Gagne ©2009
 Safety Algorithm
1. Let Work and Finish be vectors of length m and n, respectively.
Initialize:
Work = Available
Finish [i] = false for i = 0, 1, …, n- 1

2. Find an i such that both:

(a) Finish [i] = false
(b) Needi  Work
If no such i exists, go to step 4

3. Work = Work + Allocationi

Finish[i] = true
go to step 2

4. If Finish [i] == true for all i, then the system is in a safe state

Operating System Concepts – 8th Edition 7.37 Silberschatz, Galvin and Gagne ©2009
 Resource-Request Algorithm for Process Pi

Request = request vector for process Pi.

If Requesti [j] = k then process Pi wants k instances of resource type Rj
1. If Requesti  Needi go to step 2. Otherwise, raise error condition,
since process has exceeded its maximum claim
2. If Requesti  Available, go to step 3. Otherwise Pi must wait,
since resources are not available
3. Pretend to allocate requested resources to Pi by modifying the
state as follows:
Available = Available – Request;
Allocationi = Allocationi + Requesti;
Needi = Needi – Requesti;
 If safe  the resources are allocated to Pi
 If unsafe  Pi must wait, and the old resource-allocation state
is restored

Operating System Concepts – 8th Edition 7.38 Silberschatz, Galvin and Gagne ©2009
 Example of Banker’s Algorithm

 5 processes P0 through P4;

3 resource types:
A (10 instances), B (5instances), and C (7 instances)
Snapshot at time T0:

Max Allocation Available

Process A B C A B C A B C
P0 7 5 3 0 1 0 3 3 2
P1 3 2 2 2 0 0
P2 9 0 2 3 0 2
P3 2 2 2 2 1 1
P4 4 3 3 0 0 2

Operating System Concepts – 8th Edition 7.39 Silberschatz, Galvin and Gagne ©2009
 Example (Cont.)
 The content of the matrix Need is defined to be Max – Allocation

Process A B C
P0 7 4 3
P1 1 2 2
P2 6 0 0
P3 0 1 1
P4 4 3 1

Operating System Concepts – 8th Edition 7.40 Silberschatz, Galvin and Gagne ©2009
 Example (Cont.)

Need Allocation Work

Process A B C A B C A B C
P0 7 4 3 0 1 0 3 3 2
P1 1 2 2 2 0 0
P2 6 0 0 3 0 2
P3 0 1 1 2 1 1
P4 4 2 1 0 0 2

 Safe Sequence : < >

Operating System Concepts – 8th Edition 7.41 Silberschatz, Galvin and Gagne ©2009
 Example (Cont.)

Need Allocation Work

Process A B C A B C A B C
P0 7 4 3 0 1 0 3 3 2
P1 1 2 2 2 0 0 5 3 2
P2 6 0 0 3 0 2
P3 0 1 1 2 1 1
P4 4 2 1 0 0 2

 Safe Sequence : < P1>

Operating System Concepts – 8th Edition 7.42 Silberschatz, Galvin and Gagne ©2009
 Example (Cont.)

Need Allocation Work

Process A B C A B C A B C
P0 7 4 3 0 1 0 3 3 2
P1 1 2 2 2 0 0 5 3 2
P2 6 0 0 3 0 2 7 4 3
P3 0 1 1 2 1 1
P4 4 2 1 0 0 2

 Safe Sequence : < P1, P3 >

Operating System Concepts – 8th Edition 7.43 Silberschatz, Galvin and Gagne ©2009
 Example (Cont.)

Need Allocation Work

Process A B C A B C A B C
P0 7 4 3 0 1 0 3 3 2
P1 1 2 2 2 0 0 5 3 2
P2 6 0 0 3 0 2 7 4 3
P3 0 1 1 2 1 1 7 4 5
P4 4 2 1 0 0 2

 Safe Sequence : < P1, P3, P4 >

Operating System Concepts – 8th Edition 7.44 Silberschatz, Galvin and Gagne ©2009
 Example (Cont.)

Need Allocation Work

Process A B C A B C A B C
P0 7 4 3 0 1 0 3 3 2
P1 1 2 2 2 0 0 5 3 2
P2 6 0 0 3 0 2 7 4 3
P3 0 1 1 2 1 1 7 4 5
P4 4 2 1 0 0 2 7 5 5

 Safe Sequence : < P1, P3, P4, P0 >

Operating System Concepts – 8th Edition 7.45 Silberschatz, Galvin and Gagne ©2009
 Example (Cont.)
 Final safe sequence:
<P1, P3, P4, P0, P2>

 Not a unique sequence

 Possible safe sequences for the this example:

<P1,P3,P4,P0,P2>, <P1,P3,P4,P2,P0>, <P1,P3,P2,P0,P4>,

<P1,P3,P2,P4,P0>, <P1,P3,P0,P2,P4>, <P1,P3,P0,P4,P2>

Operating System Concepts – 8th Edition 7.46 Silberschatz, Galvin and Gagne ©2009
 Example: P1 Request (1,0,2)
Check that : Is Request1  Need1?
(1,0,2)  (1,2,2)  true
Check that : Is Request  Available ?
(1,0,2)  (3,3,2)  true
Need Allocation Available
Process A B C A B C A B C
P0 7 4 3 0 1 0 3 3 2
P1 1 2 2 2 0 0
P2 6 0 0 3 0 2
P3 0 1 1 2 1 1
P4 4 3 1 0 0 2

Operating System Concepts – 8th Edition 7.47 Silberschatz, Galvin and Gagne ©2009
 Example: P1 Request (1,0,2)

Need Allocation Work

Process A B C A B C A B C
P0 7 4 3 0 1 0 2 3 0
P1 0 2 0 3 0 2
P2 6 0 0 3 0 2
P3 0 1 1 2 1 1
P4 4 3 1 0 0 2
Safe Sequence : < >

Operating System Concepts – 8th Edition 7.48 Silberschatz, Galvin and Gagne ©2009
 Example: P1 Request (1,0,2)

Need Allocation Work

Process A B C A B C A B C
P0 7 4 3 0 1 0 2 3 0
P1 0 2 0 3 0 2 5 3 2
P2 6 0 0 3 0 2
P3 0 1 1 2 1 1
P4 4 3 1 0 0 2
Safe Sequence : < P1 >

Operating System Concepts – 8th Edition 7.49 Silberschatz, Galvin and Gagne ©2009
 Example: P1 Request (1,0,2)

Need Allocation Work

Process A B C A B C A B C
P0 7 4 3 0 1 0 2 3 0
P1 0 2 0 3 0 2 5 3 2
P2 6 0 0 3 0 2 7 4 3
P3 0 1 1 2 1 1
P4 4 3 1 0 0 2
Safe Sequence : < P1 ,P3 >

Operating System Concepts – 8th Edition 7.50 Silberschatz, Galvin and Gagne ©2009
 Example: P1 Request (1,0,2)

Need Allocation Work

Process A B C A B C A B C
P0 7 4 3 0 1 0 2 3 0
P1 0 2 0 3 0 2 5 3 2
P2 6 0 0 3 0 2 7 4 3
P3 0 1 1 2 1 1 7 4 5
P4 4 3 1 0 0 2
Safe Sequence : < P1 ,P3 , P4 >

Operating System Concepts – 8th Edition 7.51 Silberschatz, Galvin and Gagne ©2009
 Example: P1 Request (1,0,2)
Need Allocation Work
Process A B C A B C A B C
P0 7 4 3 0 1 0 2 3 0
P1 0 2 0 3 0 2 5 3 2
P2 6 0 0 3 0 2 7 4 3
P3 0 1 1 2 1 1 7 4 5
P4 4 3 1 0 0 2 7 4 5
Safe Sequence : < P1 ,P3 , P4 ,P0 ,P2 >
 Executing safety algorithm shows that sequence < P1, P3, P4, P0, P2> satisfies
safety requirement. So Yes, P1’s request may be granted immediately.

 Can request for (0,2,0) by P0 be granted?

Operating System Concepts – 8th Edition 7.52 Silberschatz, Galvin and Gagne ©2009
 Example: P0 Request (0,2,0)
Check that : Is Request0  Need0?
(0,2,0)  (7,4,3)  true
Check that : Is Request  Available ?
(0,2,0)  (3,3,2)  true
Need Allocation Available
Process A B C A B C A B C
P0 7 4 3 0 1 0 3 3 2
P1 1 2 2 2 0 0
P2 6 0 0 3 0 2
P3 0 1 1 2 1 1
P4 4 3 1 0 0 2

Operating System Concepts – 8th Edition 7.53 Silberschatz, Galvin and Gagne ©2009
 Example: P0 Request (0,2,0)

Need Allocation Work

Process A B C A B C A B C
P0 7 2 3 0 3 0 3 1 2
P1 1 2 2 2 0 0
P2 6 0 0 3 0 2
P3 0 1 1 2 1 1
P4 4 3 1 0 0 2
Safe Sequence : < >

Operating System Concepts – 8th Edition 7.54 Silberschatz, Galvin and Gagne ©2009
 Example: P0 Request (0,2,0)

Need Allocation Work

Process A B C A B C A B C
P0 7 2 3 0 3 0 3 1 2
P1 1 2 2 2 0 0 5 2 3
P2 6 0 0 3 0 2
P3 0 1 1 2 1 1
P4 4 3 1 0 0 2
Safe Sequence : < P3 ,>

Operating System Concepts – 8th Edition 7.55 Silberschatz, Galvin and Gagne ©2009
 Example: P0 Request (0,2,0)

Need Allocation Work

Process A B C A B C A B C
P0 7 2 3 0 3 0 3 1 2
P1 1 2 2 2 0 0 5 2 3
P2 6 0 0 3 0 2 7 2 3
P3 0 1 1 2 1 1
P4 4 3 1 0 0 2
Safe Sequence : < P3 ,P1 >

Operating System Concepts – 8th Edition 7.56 Silberschatz, Galvin and Gagne ©2009
 Example: P0 Request (0,2,0)

Need Allocation Work

Process A B C A B C A B C
P0 7 2 3 0 3 0 3 1 2
P1 1 2 2 2 0 0 5 2 3
P2 6 0 0 3 0 2 7 2 3
P3 0 1 1 2 1 1 10 2 5
P4 4 3 1 0 0 2
Safe Sequence : < P3 ,P1,P2 >

Operating System Concepts – 8th Edition 7.57 Silberschatz, Galvin and Gagne ©2009
 Example: P0 Request (0,2,0)
Need Allocation Work
Process A B C A B C A B C
P0 7 2 3 0 3 0 3 1 2
P1 1 2 2 2 0 0 5 2 3
P2 6 0 0 3 0 2 7 2 3
P3 0 1 1 2 1 1 10 2 5
P 4 3 1
Safe Sequence : 4< P3 ,P1,P2 ,P0,P4>
0 0 2 10 5 5

 Executing safety algorithm shows that sequence < P3 ,P1,P2 ,P0,P4> satisfies safety
requirement. So Yes, P0’s request may be granted immediately.

Operating System Concepts – 8th Edition 7.58 Silberschatz, Galvin and Gagne ©2009
 Example: P4 Request (3,3,0)

 Can request for (3,3,0) by P4 be granted?

 Do it yourself !

Operating System Concepts – 8th Edition 7.59 Silberschatz, Galvin and Gagne ©2009
 Deadlock Detection
 Allow system to enter deadlock state

 Detection algorithm

 Recovery scheme

Operating System Concepts – 8th Edition 7.60 Silberschatz, Galvin and Gagne ©2009
 Single Instance of Each Resource Type

 Maintain wait-for graph

 Nodes are processes
 Pi  Pj if Pi is waiting for Pj

 Periodically invoke an algorithm that searches for a cycle in the

graph. If there is a cycle, there exists a deadlock

 An algorithm to detect a cycle in a graph requires an order of n2

operations, where n is the number of vertices in the graph
(Expensive)

Operating System Concepts – 8th Edition 7.61 Silberschatz, Galvin and Gagne ©2009
  A deadlock detection algorithm that uses a
variant of the resource-allocation graph,
called a wait-for graph.
 Remove the resource nodes.
 Collapse the appropriate edges.

 An edge from Pi to Pj implies that Pi is waiting for

Pj to release a resource that Pi needs.
 The corresponding resource allocation graph contains two edges Pi  Rq
and Rq  Pj for some resource Rq.

Operating System Concepts – 8th Edition 7.62 Silberschatz, Galvin and Gagne ©2009
 Resource-Allocation Graph and
Wait-for Graph

Resource-Allocation Graph Corresponding wait-for graph

Operating System Concepts – 8th Edition 7.63 Silberschatz, Galvin and Gagne ©2009
Operating System Concepts – 8th Edition 7.64 Silberschatz, Galvin and Gagne ©2009
 Several Instances of a Resource Type

 Available: A vector of length m indicates the number of available

resources of each type.

 Allocation: An n x m matrix defines the number of resources of each

type currently allocated to each process.

 Request: An n x m matrix indicates the current request of each

process. If Request [i][j] = k, then process Pi is requesting k more
instances of resource typeRj.

Operating System Concepts – 8th Edition 7.65 Silberschatz, Galvin and Gagne ©2009
 Detection Algorithm
1. Let Work and Finish be vectors of length m and n, respectively Initialize:
(a) Work = Available
(b) For i = 1,2, …, n, if Allocationi  0, then
Finish[i] = false; else, Finish[i] = true
2. Find an index i such that both:
(a) Finish[i] == false
(b) Requesti  Work
If no such i exists, go to step 4
3. Work = Work + Allocationi
Finish[i] = true
go to step 2
4. If Finish[i] == false, for some i, 1  i  n, then the system is in deadlock
state. Moreover, if Finish[i] == false, then Pi is deadlocked
Algorithm requires an order of O(m x n2) operations to detect whether
the system is in deadlocked state

Operating System Concepts – 8th Edition 7.66 Silberschatz, Galvin and Gagne ©2009
 Example of Detection Algorithm
 Five processes P0 through P4; three resource types
A (7 instances), B (2 instances), and C (6 instances)
 Snapshot at time T0:

Allocation Request Work

Process A B C A B C A B C
P0 0 1 0 0 0 0 0 0 0
P1 2 0 0 2 0 2
P2 3 0 3 0 0 0
P3 2 1 1 1 0 0
P4 0 0 2 0 0 2

 Sequence <>

Operating System Concepts – 8th Edition 7.67 Silberschatz, Galvin and Gagne ©2009
 Example of Detection Algorithm

Allocation Request Work

Process A B C A B C A B C
P0 0 1 0 0 0 0 0 0 0
P1 2 0 0 2 0 2 0 1 0
P2 3 0 3 0 0 0
P3 2 1 1 1 0 0
P4 0 0 2 0 0 2

 Sequence <P0 >

Operating System Concepts – 8th Edition 7.68 Silberschatz, Galvin and Gagne ©2009
 Example of Detection Algorithm

Allocation Request Work

Process A B C A B C A B C
P0 0 1 0 0 0 0 0 0 0
P1 2 0 0 2 0 2 0 1 0
P2 3 0 3 0 0 0 3 1 3
P3 2 1 1 1 0 0
P4 0 0 2 0 0 2

 Sequence <P0, P2 >

Operating System Concepts – 8th Edition 7.69 Silberschatz, Galvin and Gagne ©2009
 Example of Detection Algorithm

Allocation Request Work

Process A B C A B C A B C
P0 0 1 0 0 0 0 0 0 0
P1 2 0 0 2 0 2 0 1 0
P2 3 0 3 0 0 0 3 1 3
P3 2 1 1 1 0 0 5 2 4
P4 0 0 2 0 0 2

 Sequence <P0, P2, P3 >

Operating System Concepts – 8th Edition 7.70 Silberschatz, Galvin and Gagne ©2009
 Example of Detection Algorithm

Allocation Request Work

Process A B C A B C A B C
P0 0 1 0 0 0 0 0 0 0
P1 2 0 0 2 0 2 0 1 0
P2 3 0 3 0 0 0 3 1 3
P3 2 1 1 1 0 0 5 2 4
P4 0 0 2 0 0 2 5 2 6

 Sequence <P0, P2, P3,P4,P1>

Operating System Concepts – 8th Edition 7.71 Silberschatz, Galvin and Gagne ©2009
 Example of Detection Algorithm
 Final finish sequence:

< P0, P2, P3, P4 , P1 > will result in Finish[i] = true for all i

 Other possible finish sequences:

< P0, P2, P3, P1 , P4 > ?

< P0, P2, P4, P1 , P3 > ?
< P0, P2, P4, P3 , P1 > ?

Operating System Concepts – 8th Edition 7.72 Silberschatz, Galvin and Gagne ©2009
 Another Example
 P2 requests an additional instance of C.
 Do we have a finish sequence?

Request
Process A B C
P0 0 0 0
P1 2 0 2
P2 0 0 1
P3 1 0 0
P4 0 0 2

Operating System Concepts – 8th Edition 7.73 Silberschatz, Galvin and Gagne ©2009
 Another Example (Cont.)

Allocation Request Work

Process A B C A B C A B C
P0 0 1 0 0 0 0 0 0 0
P1 2 0 0 2 0 2
P2 3 0 3 0 0 1
P3 2 1 1 1 0 0
P4 0 0 2 0 0 2

 Finish Sequence : < >

Operating System Concepts – 8th Edition 7.74 Silberschatz, Galvin and Gagne ©2009
 Another Example (Cont.)

Allocation Request Work

Process A B C A B C A B C
P0 0 1 0 0 0 0 0 0 0
P1 2 0 0 2 0 2 0 1 0
P2 3 0 3 0 0 1
P3 2 1 1 1 0 0
P4 0 0 2 0 0 2

 Finish Sequence : < P0 >

Operating System Concepts – 8th Edition 7.75 Silberschatz, Galvin and Gagne ©2009
 Another Example (Cont.)
 State of system?
 Can reclaim resources held by process P0, but insufficient resources
to fulfill other processes; requests
 Deadlock exists, consisting of processes P1, P2, P3, and P4

Operating System Concepts – 8th Edition 7.76 Silberschatz, Galvin and Gagne ©2009
 Detection-Algorithm Usage
 When, and how often, to invoke depends on:
 How often a deadlock is likely to occur?
 How many processes will need to be rolled back?
 one for each disjoint cycle
 Can be invoked every time a request for allocation cannot be granted
immediately—expensive but process causing the deadlock is identified,
along with processes involved in deadlock
 Can be invoked Periodically, or based on CPU utilization (drop)

 If detection algorithm is invoked arbitrarily, there may be many cycles

in the resource graph and so we would not be able to tell which of the
many deadlocked processes “caused” the deadlock.

Operating System Concepts – 8th Edition 7.77 Silberschatz, Galvin and Gagne ©2009
 Recovery from Deadlock:
Process Termination
 Abort all deadlocked processes

 Abort one process at a time until the deadlock cycle is eliminated

 In which order should we choose to abort?

 Priority of the process
 How long process has computed, and how much longer to
completion
 Resources the process has used
 Resources process needs to complete
 How many processes will need to be terminated
 Is process interactive or batch?

Operating System Concepts – 8th Edition 7.78 Silberschatz, Galvin and Gagne ©2009
 Recovery from Deadlock:
Resource Preemption

 Selecting a victim – minimize cost

 Rollback – return to some safe state, restart process for that state

 Starvation – same process may always be picked as victim,

include number of rollback in cost factor

Operating System Concepts – 8th Edition 7.79 Silberschatz, Galvin and Gagne ©2009
 End of Chapter 7

Operating System Concepts – 8th Edition Silberschatz, Galvin and Gagne ©2009