Chapter 7: Deadlocks

Chapter 7: Deadlocks
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 - 7th Edition, Feb 14, 2005 7.2 Silberschatz, Galvin and Gagne ©2005
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.
The Deadlock Problem
A situation in which a set of blocked processes each holding a

resource and waiting to acquire a resource held by another
process in the set (we have a finite number of resources)
Example
z System has 2 disk drives.
z P1 and P2 each hold one disk drive and each needs
another one.
Example
z semaphores A and B, initialized to 1
P0 P1
wait (A); wait(B)
wait (B); wait(A)
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.
System Model
System consists of a finite number of resources to be distributed

among a number of competing processes.
Resource types R1, R2, . . ., Rm
CPU cycles, memory space, I/O devices
Each resource type Ri has Wi instances.
z If a system has 2 CPUs, the resource type CPU has 2 instances
Each process utilizes a resource as follows:
z Request: if not granted wait until it is available.
z Use: operate on the resource
z Release: releases the resource after finishing.
Request and release are system calls if the resource is managed by
the OS.
Deadlock Characterization
In order for deadlock to occur, four necessary conditions must
hold simultaneously
Mutual exclusion: only one process at a time can use a
resource (the resource is non-sharable)
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.
Resource-Allocation Graph
Deadlocks can be described using a system resource-allocation

graph, which consists of a set of vertices V and a set of edges
E.
V is partitioned into two types:
z P = {P1, P2, …, Pn}, the set consisting of all the processes in
the system.
z R = {R1, R2, …, Rm}, the set consisting of all resource types

in the system.
Edges are of two types:
z request edge – directed edge Pi → Rj
z assignment edge – directed edge Rj → Pi
each process is represented as a circle, and each
resource as a rectangle with each instance represented
by a dot in the rectangle.
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
Example of a Resource Allocation Graph
Resource Allocation Graph With A Deadlock
Basic Facts
If graph contains no cycles ⇒ no deadlock.
If graph contains a cycle ⇒ deadlock may exist

z if there is only one instance per resource type, then
deadlock.
in this case a cycle is both a necessary and
sufficient condition for the existence of deadlock
z if there are multiple instances of each resource type,
possibility of deadlock.
in this case a cycle is a necessary and not
sufficient condition for the existence of deadlock
Graph With A Cycle But No Deadlock
Methods for Handling Deadlocks
Ensure that the system will never enter a deadlock state

through a protocol to prevent or avoid deadlocks
Allow the system to enter a deadlock state, detect it, and

then recover.
Ignore the problem and pretend that deadlocks never occur

in the system; used by most operating systems, including
UNIX. Deadlock prevention/handling is left up to
programmers.
Deadlock Prevention
Restrain the ways request can be made in order to insure that at
least one of the necessary conditions is not hold.
Mutual Exclusion – not required for sharable resources (such

as read only files); must hold for nonsharable resources (such
as a printer).
Hold and Wait – must guarantee that whenever a process

requests a resource, it does not hold any other resources.
z 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.
z Disadv: Low resource utilization (resources may be
allocated but unused for long time); starvation possible.
Deadlock Prevention (Cont.)
No Preemption –
z 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 (or
releases per request from other processes).
z Preempted resources are added to the list of resources for
which the process is waiting.
z Process will be restarted only when it can regain its old
resources, as well as the new ones that it is requesting.
Circular Wait – impose a total ordering of all resource types,

and require that each process requests resources in an
increasing order of enumeration.
In general, prevention methods result in low device utilization
and reduced system throughput
Deadlock Avoidance
Requires that the system has some additional a priori information

available about resources are to be requested.
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.
Safe State
When a process requests an available resource, the system

must decide if immediate allocation leaves the system in a
safe state.
The system is in a safe state if it can allocate resources to
each process (up to its maximum) in some order and still
avoid a deadlock. More formally, a system is in a safe state
only if there exists a safe sequence in which the processes
can be executed.
Safe State
System is in safe state if there exists a sequence <P1, P2, …, Pn>

of ALL the processes in the systems such that for each Pi, the
resources that Pi can still request can be satisfied by currently
available resources + resources held by all the Pj, with j < i.
That is:
z If Pi resource needs are not immediately available, then Pi
can wait until all Pj have finished.
z When Pj is finished, Pi can obtain needed resources,
execute, return allocated resources, and terminate.
z When Pi terminates, Pi +1 can obtain its needed resources,
and so on.
If there is no safe sequence, the system is said to be unsafe
Basic Facts
If a system is in safe state ⇒ no deadlocks.
If a system is in unsafe state ⇒ possibility of deadlock.

z If a system is in deadlock state ⇒ it is in unsafe state
Avoidance ⇒ ensure that a system will never enter an

unsafe state.
z As long as the system is in safe state, the OS can
avoid the unsafe (deadlock) state
Safe, Unsafe , Deadlock State
Example
Consider a system with 12 tape drives and 3 processes P0, P1,

and P2.
Max. Needs Has
P0 10 5
P1 4 2
P2 9 2
The system is in a safe state. The sequence <P1, P0, P2> satisfies
the safety condition, since P1 can get all its drives and then return
them, then P0, then P2.
Example (cont.)
Suppose P2 requests and is allocated 1 more tape drive:

Max. Needs Has
P0 10 5
P1 4 2
P2 9 3
The system is in an unsafe state. Only P1 can get all its drives.
When it returns them, there will be only 4 free drives.
Avoidance algorithms
For a system with only a single instance of each resource

type, use a variant of the resource-allocation graph.
For a system with multiple instances of resource type, use

the banker’s 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, before a

process begins executing
Resource-Allocation Graph
Unsafe State In Resource-Allocation Graph
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. If granting the request causes a cycle in the
graph, then the system would be in a unsafe state,
and the process must wait.
z Note: An algorithm for detecting a cycle in this
graph requires an order of n2 operations, where n
is the number of processes in the system.
Banker’s Algorithm
For resources types with multiple instances.
Each process must a priori claim for its maximum resource

use.
When a process requests a resource it may have to wait, if

granting the request would put the system into an unsafe
state.
When a process gets all its resources it must return them in

a finite amount of time.
Data Structures for the Banker’s Algorithm
Let n = number of processes, and m = number of resource 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].

We can treat each row in the matrices as a vector:
z Allocationi: resources currently allocated to Pi
z Needi: additional resources Pi may still request to complete its task
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.
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.
When a request for resources is made by Pi:
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;
z If safe ⇒ the resources are allocated to Pi.
z If unsafe ⇒ Pi must wait, and the old resource-allocation
state is restored
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:
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.
Allocation Max Need Available

ABC ABC ABC ABC
P0 010 753 743 332
P1 200 322 122
P2 302 902 600
P3 211 222 011
P4 002 433 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.

Pretend that this request is fulfilled, the new matrices are:
[new] Allocation Need Available
ABC ABC ABC
P0 010 743 230
P1 302 020
P2 301 600
P3 211 011
P4 002 431
Executing safety algorithm shows that sequence < P1, P3, P4, P0, P2>
satisfies safety requirement ⇒ request is granted
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 (algorithm)
This approach (detection and recovery) requires more overhead:

z Maintaining the necessary info and execution of the detection
algorithm
z Recovering from a deadlock
Single Instance of Each Resource Type
Maintain wait-for graph (variant of the resource-allocation

graph)
z Nodes are processes.
z 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.
Resource-Allocation Graph and Wait-for Graph
Resource-Allocation Graph Corresponding wait-for graph
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 [ij] = k, then process Pi is
requesting k more instances of resource type. Rj.
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;otherwise, 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.
Detection Algorithm (Cont.)
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.
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 Available
ABC ABC ABC
P0 010 000 000
P1 200 202
P2 303 000
P3 211 100
P4 002 002
Sequence <P0, P2, P3, P1, P4> will result in Finish[i] = true for all i.
Example (Cont.)
P2 requests an additional instance of type C.

Request
ABC
P0 000
P1 201
P2 001
P3 100
P4 002
State of system?
z Can reclaim resources held by process P0, but insufficient
resources to fulfill other processes; requests.
z Deadlock exists, consisting of processes P1, P2, P3, and P4.
Detection-Algorithm Usage
When, and how often, to invoke depends on:

z How often a deadlock is likely to occur?
z How many processes will will be affected by deadlock when it
occurs?
Should the detection algorithm be invoked for every resource
allocation, or at less frequent intervals?
z If invoked for every allocation, considerable overhead.
z If invoked at intervals, 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.

z Great expense, as some processes might have computed for along
time
Abort one process at a time until the deadlock cycle is eliminated.
z Mush overhead, as the adetection algorithm must run after each
termination of a process
In which order should we choose to abort?
z Priority of the process.
z How long process has computed, and how much longer to completion.
z Resources the process has used.
z Resources process needs to complete.
z How many processes will need to be terminated.
z 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

Chapter 7: Deadlocks

Caricato da

Informazioni sul documento

Titolo originale

Copyright

Formati disponibili

Condividi questo documento

Condividi o incorpora il documento

Opzioni di condivisione

Hai trovato utile questo documento?

Questo contenuto è inappropriato?

Copyright:

Formati disponibili

Chapter 7: Deadlocks

Caricato da

Copyright:

Formati disponibili

Chapter 7: Deadlocks

 The Deadlock Problem

 To develop a description of deadlocks, which prevent

 A situation in which a set of blocked processes each holding a

 Traffic only in one direction.

 System consists of a finite number of resources to be distributed

 Deadlocks can be described using a system resource-allocation

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

 Resource Type with 4 instances

 If graph contains no cycles ⇒ no deadlock.

 If graph contains a cycle ⇒ deadlock may exist

 Ensure that the system will never enter a deadlock state

 Allow the system to enter a deadlock state, detect it, and

 Ignore the problem and pretend that deadlocks never occur

 Mutual Exclusion – not required for sharable resources (such

 Hold and Wait – must guarantee that whenever a process

 Circular Wait – impose a total ordering of all resource types,

Requires that the system has some additional a priori information

 Simplest and most useful model requires that each process

 The deadlock-avoidance algorithm dynamically examines

 Resource-allocation state is defined by the number of

 When a process requests an available resource, the system

 System is in safe state if there exists a sequence <P1, P2, …, Pn>

 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

 Consider a system with 12 tape drives and 3 processes P0, P1,

 Suppose P2 requests and is allocated 1 more tape drive:

 For a system with only a single instance of each resource

 For a system with multiple instances of resource type, use

 Claim edge Pi → Rj indicated that process Pj may request

 Claim edge converts to request edge when a process

 Request edge converted to an assignment edge when the

 When a resource is released by a process, assignment

 Resources must be claimed a priori in the system, before a

 Suppose that process Pi requests a resource Rj

 The request can be granted only if converting the

 For resources types with multiple instances.

 Each process must a priori claim for its maximum resource

 When a process requests a resource it may have to wait, if

 When a process gets all its resources it must return them in

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

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

1. Let Work and Finish be vectors of length m and n,

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

 5 processes P0 through P4;

 The content of the matrix Need is defined to be Max – Allocation.

Allocation Max Need Available

 Check that Request ≤ Available (that is, (1,0,2) ≤ (3,3,2) ⇒ true.

 Allow system to enter deadlock state

 Recovery scheme (algorithm)

 This approach (detection and recovery) requires more overhead:

 Maintain wait-for graph (variant of the resource-allocation

 Periodically invoke an algorithm that searches for a cycle in

 An algorithm to detect a cycle in a graph requires an order

Resource-Allocation Graph Corresponding wait-for graph

 Available: A vector of length m indicates the number of

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

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

1. Let Work and Finish be vectors of length m and n, respectively

If no such i exists, go to step 4.

3. Work = Work + Allocationi

4. If Finish[i] == false, for some i, 1 ≤ i ≤ n, then the system is in

The Deadlock Problem

To develop a description of deadlocks, which prevent

A situation in which a set of blocked processes each holding a

Traffic only in one direction.

System consists of a finite number of resources to be distributed

Deadlocks can be described using a system resource-allocation

Resource Type with 4 instances

If graph contains no cycles ⇒ no deadlock.

If graph contains a cycle ⇒ deadlock may exist

Ensure that the system will never enter a deadlock state

Allow the system to enter a deadlock state, detect it, and

Ignore the problem and pretend that deadlocks never occur

Mutual Exclusion – not required for sharable resources (such

Hold and Wait – must guarantee that whenever a process

Circular Wait – impose a total ordering of all resource types,

Simplest and most useful model requires that each process

The deadlock-avoidance algorithm dynamically examines

Resource-allocation state is defined by the number of

When a process requests an available resource, the system

System is in safe state if there exists a sequence <P1, P2, …, Pn>

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

Consider a system with 12 tape drives and 3 processes P0, P1,

Suppose P2 requests and is allocated 1 more tape drive:

For a system with only a single instance of each resource

For a system with multiple instances of resource type, use

Claim edge Pi → Rj indicated that process Pj may request

Claim edge converts to request edge when a process

Request edge converted to an assignment edge when the

When a resource is released by a process, assignment

Resources must be claimed a priori in the system, before a

Suppose that process Pi requests a resource Rj

The request can be granted only if converting the

For resources types with multiple instances.

Each process must a priori claim for its maximum resource

When a process requests a resource it may have to wait, if

When a process gets all its resources it must return them in

5 processes P0 through P4;

The content of the matrix Need is defined to be Max – Allocation.

Check that Request ≤ Available (that is, (1,0,2) ≤ (3,3,2) ⇒ true.

Allow system to enter deadlock state

Recovery scheme (algorithm)

This approach (detection and recovery) requires more overhead:

Maintain wait-for graph (variant of the resource-allocation

Periodically invoke an algorithm that searches for a cycle in

An algorithm to detect a cycle in a graph requires an order

Available: A vector of length m indicates the number of

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

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

Five processes P0 through P4; three resource types

P2 requests an additional instance of type C.

When, and how often, to invoke depends on:

Abort all deadlocked processes.

Selecting a victim – minimize cost.

Starvation – same process may always be picked as victim,