CH 7

Chapter 7: Deadlocks
Operating System Concepts 9th Edition Silberschatz, Galvin and Gagne 2013
Chapter 7: Deadlocks
System Model
Deadlock Characterization
Methods for Handling Deadlocks
Deadlock Prevention
Deadlock Avoidance
Deadlock Detection
Recovery from Deadlock
Operating System Concepts 9th Edition 7.2 Silberschatz, Galvin and Gagne 2013
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
System Model
System consists of resources
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
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, , Pn1
is waiting for a resource that is held by Pn, and Pn is waiting
for a resource that is held by P0.
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
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
Methods for Handling Deadlocks
Ensure that the system will never enter a deadlock

state:
Deadlock prevention
Deadlock avoidence
Allow the system to enter a deadlock state and then
recover
Ignore the problem and pretend that deadlocks never
occur in the system; used by most operating systems,
including UNIX
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 sequence <P1, P2, , Pn>
of ALL the processes in the systems
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
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.
Avoidance Algorithms
Single instance of a resource type

Use a resource-allocation graph
Multiple instances of a resource type

Use the bankers algorithm
Resource-Allocation Graph 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
Bankers 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
Data Structures for the Bankers 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]
Resource-Request Algorithm for Process Pi
Requesti = 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 Requesti;
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
Example of Bankers Algorithm
5 processes P0 through P4;

3 resource types:
A (10 instances), B (5instances), and C (7 instances)
Snapshot at time T0:
Allocation Max Available
ABC ABC ABC
P0 010 753 332
P1 200 322
P2 302 902
P3 211 222
P4 002 433
Example (Cont.)
The content of the matrix Need is defined to be Max Allocation
Need
ABC
P0 743
P1 122
P2 600
P3 011
P4 431
The system is in a safe state since the sequence < P1, P3, P4, P2, P0>
satisfies safety criteria
Example: P1 Request (1,0,2)
Check that Request Available (that is, (1,0,2) (3,3,2) true
Allocation Need Available
ABC ABC ABC
P0 010 743 230
P1 302 020
P2 302 600
P3 211 011
P4 002 431
Executing safety algorithm shows that sequence < P1, P3, P4, P0, P2>
satisfies safety requirement
Can request for (3,3,0) by P4 be granted?
Can request for (0,2,0) by P0 be granted?
Deadlock Detection
Allow system to enter deadlock state
Detection algorithm
Recovery scheme
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
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.
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?

1. Priority of the process
2. How long process has computed, and how much longer to
completion
3. Resources the process has used
4. Resources process needs to complete
5. How many processes will need to be terminated
6. Is process interactive or batch?
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
End of Chapter 7
Operating System Concepts 9th Edition Silberschatz, Galvin and Gagne 2013

CH 7

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

CH 7

Uploaded by

Copyright:

Available Formats

Chapter 7: Deadlocks

To develop a description of deadlocks, which prevent

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

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

request edge directed edge Pi Rj

assignment edge directed edge Rj Pi

Resource Type with 4 instances

Ensure that the system will never enter a deadlock

When a process requests an available resource, system must

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

Single instance of a resource type

Multiple instances of a resource type

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

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

Available: Vector of length m. If available [j] = k, there are k

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

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

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

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

Requesti = request vector for process Pi. If Requesti [j] = k then

5 processes P0 through P4;

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

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

Allow system to enter deadlock state

If detection algorithm is invoked arbitrarily, there may be many

Abort all deadlocked processes

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

In which order should we choose to abort?

Selecting a victim minimize cost

Rollback return to some safe state, restart process for that

Starvation same process may always be picked as victim,

You might also like