Scribd
Upload
27 views14 pages

Lec 18 Deadlock Detection and Recovery

Uploaded by

Priyanka Suri
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
27 views14 pages

Lec 18 Deadlock Detection and Recovery

Uploaded by

Priyanka Suri
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 14

OPERATING

SYSTEM:
COCSC301/
CACSC301
OUTLINE

Deadlock detection
Deadlock recovery
DEADLOCK DETECTION

Allow system to enter deadlock state

Detection algorithm

Recovery scheme
DEADLOCK DETECTION: SINGLE INSTANCE

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
RESOURCE ALLOCATION AND WAIT FOR GRAPH
SEVERAL INSTANCES OF 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 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
DETECTION ALGORITHM : EXAMPLE
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
DETECTION ALGORITHM : EXAMPLE (CONT)

P2 requests an additional instance of type C


Request
ABC
P0 000
P1 202
P2 001
P3 100
P4 002
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
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.
DEADLOCK RECOVERY

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?
DEADLOCK RECOVERY

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

You might also like