DEADLOCK Dsatm

Deadlocks
Definition: A process request resources, if the resources are not

available at that time, the process enter the waiting state. Waiting
process may never change state, because the resources that they have
requested are held by other waiting process.
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:
(Resource allocation sequence)
 request
 use
 release
Deadlock Characterization
Necessary Condition
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.
Resource-Allocation Graph
Process
Resource Type with 4 instances
Pi requests instance of Rj
Pi is holding an instance of Rj
Resource Allocation Graph With A Deadlock
Graph with A Cycle But No Deadlock

o If graph contains no cycles  no deadlock
o If graph contains a cycle 
 if only one instance per resource type, then deadlock
 if several instances per resource type, possibility of
deadlock
Methods for Handling Deadlocks
o Ensure that the system will never enter a deadlock state:
 Deadlock prevention
 Deadlock avoidance
o Allow the system to enter a deadlock state and then recover
o Ignore the problem and pretend that deadlocks never occur in
the system; used by most operating systems, including UNIX
Deadlock Prevention
 Mutual Exclusion – not required for sharable resources (e.g.,

read-only files); must hold for non-sharable resources
 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 allocated to it.
Disadvantages: Low resource utilization; starvation possible

 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
 Circular Wait – impose a total ordering of all resource types, and

require that each process requests resources in an increasing order
of enumeration
Deadlock Avoidance
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 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:
 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
 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
o Single instance of a resource type
 Use a resource-allocation graph
o Multiple instances of a resource type
 Use the banker’s algorithm
Resource-Allocation Graph Scheme

o Claim edge Pi  Rj indicated that process Pj may request
resource Rj; represented by a dashed line
o Claim edge converts to request edge when a process requests
a resource
o Request edge converted to an assignment edge when the
resource is allocated to the process
o When a resource is released by a process, assignment edge
reconverts to a claim edge
o Resources must be claimed a priori in the system
o Suppose that process Pi requests a resource Rj

o 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
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
Data Structures for the Banker’s Algorithm
Let n = number of processes, 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]
Safety Algorithm
Let Work and Finish be vectors of length m and n, respectively.
Initialize:
1. 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

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
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

DEADLOCK Dsatm

Uploaded by

Copyright:

Available Formats

DEADLOCK Dsatm

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

DEADLOCK Dsatm

Uploaded by

Copyright:

Available Formats

Deadlocks

Definition: A process request resources, if the resources are not

Resource Type with 4 instances

Graph with A Cycle But No Deadlock

 Mutual Exclusion – not required for sharable resources (e.g.,

 Hold and Wait – must guarantee that whenever a process requests

Require process to request and be allocated all its resources before

Disadvantages: Low resource utilization; starvation possible

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

Resource-Allocation Graph Scheme

o Suppose that process Pi requests a resource Rj

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

(b) Needi  Work

Resource-Request Algorithm for Process Pi

1. If Requesti  Needi go to step 2. Otherwise, raise error condition,

5 processes P0 through P4;

You might also like