Nama : Gabriela Gracia Dien

Nim : 211011060083

MK : Sistem Operasi

Dosen Pengampu : Wisard Kalengkongan M.kom

Chapter 7: Deadlocks
Deadlock is a situation where requests cannot be executed by the scheduler because the
requests are waiting for each other. Deadlock is a major problem in sharing data.

System Model

• System consists of resources

• Resource types R1, R2, . . ., Rm
• Each resource type Ri has Wi instances.
• Each process utilizes a resource as follows:

o request

o use

o release

Deadlock Characterization

• 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

A set of vertices V and a set of edges E

• V is partitioned into two types:

 o P = {P1, P2, …, Pn}, the set consisting of all the processes in the system

o 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
• Process

• Resource Type with 4 instances

• Pi requests instance of Rj

• Pi is holding an instance of Rj

Basic Facts

If graph contains no cycles  no deadlock

If graph contains a cycle 

1. if only one instance per resource type, then deadlock

2. if several instances per resource type, possibility of deadlock

Methods for Handling Deadlocks

• Ensure that the system will never enter a deadlock state:

1. Deadlock prevention
2. 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
Deadlock Prevention

Restrain the ways request can be made

• 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

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

o 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
o Preempted resources are added to the list of resources for which the
process is waiting
o 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

• 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

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

 o Use a resource-allocation graph

• Multiple instances of a resource type

o 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

• 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

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

Deadlock Detection

• Allow system to enter deadlock state

• Detection algorithm
• Recovery scheme

Single Instance of Each Resource Type

• Maintain wait-for graph

o Nodes are processes
o 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
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

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

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