Operating System Deadlock Galvin

50 %
50 %
Information about Operating System Deadlock Galvin

Published on February 28, 2009

Author: sonalichauhan

Source: slideshare.net

Operating System: DEADLOCKS SONALI C. BSc (IT) UDIT Deadlocks-Galvin sonali C.

What is Deadlock? A set of blocked processes each holding a resource and waiting to acquire a resource held by another process in the set. Example System has 2 disk drives. P 1 and P 2 each hold one disk drive and each needs another one. Example 2 train approaches each other at crossing, both will come to full stop and neither shall start until other has gone. Deadlocks-Galvin sonali C.

A set of blocked processes each holding a resource and waiting to acquire a resource held by another process in the set.

Example

System has 2 disk drives.

P 1 and P 2 each hold one disk drive and each needs another one.

Example

2 train approaches each other at crossing, both will come to full stop and neither shall start until other has gone.

Deadlock 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 Deadlocks-Galvin sonali C.

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

What are we covering? 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. Deadlocks-Galvin sonali C.

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 Each resource type R i has W i instances. Resource types R 1 , R 2 , . . ., R m CPU cycles, memory space, I/O devices System has 2 CPUs, then resource type CPU has 2 instance. Each process utilizes a resource as follows: request (system call) use release (system call) Deadlocks-Galvin sonali C.

Each resource type R i has W i instances.

Resource types R 1 , R 2 , . . ., R m

CPU cycles, memory space, I/O devices

System has 2 CPUs, then resource type CPU has 2 instance.

Each process utilizes a resource as follows:

request (system call)

use

release (system call)

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. Deadlocks-Galvin sonali C.

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 { P 0 , P 1 , …, P 0 } of waiting processes such that P 0 is waiting for a resource that is held by P 1 , P 1 is waiting for a resource that is held by P 2 , …, P n –1 is waiting for a resource that is held by P n , and P 0 is waiting for a resource that is held by P 0 . Deadlocks-Galvin sonali C. CONT…

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 { P 0 , P 1 , …, P 0 } of waiting processes such that P 0 is waiting for a resource that is held by P 1 , P 1 is waiting for a resource that is held by

P 2 , …, P n –1 is waiting for a resource that is held by P n , and P 0 is waiting for a resource that is held by P 0 .

RESOURCE-ALLOCATION GRAPH Deadlocks can be described in term of directed graph- SYSTEM RESOURCE-ALLOCATION GRAPH . A set of vertices V and a set of edges E . V is partitioned into two types: P = { P 1 , P 2 , …, P n }, the set consisting of all the processes in the system. R = { R 1 , R 2 , …, R m }, the multi-set consisting of all resource types in the system. request edge – directed edge P 1  R j assignment edge – directed edge R j  P i Deadlocks-Galvin sonali C.

Deadlocks can be described in term of directed graph- SYSTEM RESOURCE-ALLOCATION GRAPH .

A set of vertices V and a set of edges E .

V is partitioned into two types:

P = { P 1 , P 2 , …, P n }, the set consisting of all the processes in the system.

R = { R 1 , R 2 , …, R m }, the multi-set consisting of all resource types in the system.

request edge – directed edge P 1  R j

assignment edge – directed edge R j  P i

RESOURCE-ALLOCATION GRAPH Process Resource Type with 4 instances P i requests instance of R j P i is holding an instance of R j Deadlocks-Galvin sonali C. CONT… P i P i R j R j

Process

Resource Type with 4 instances

P i requests instance of R j

P i is holding an instance of R j

EXAMPLE OF RESOURCE-ALLOCATION GRAPH Deadlocks-Galvin sonali C. CONT…

RESOURCE-ALLOCATION GRAPH WITH A DEADLOCK P1 -> R1 -> P2 -> R3 -> P3 -> R2 -> P1 P2 -> R3 -> P3 -> R2 -> P1 Deadlocks-Galvin sonali C. CONT…

P1 -> R1 -> P2 -> R3 -> P3 -> R2 -> P1

P2 -> R3 -> P3 -> R2 -> P1

GRAPH WITH A CYCLE BUT NO DEADLOCK P1 -> R1 -> P3 -> R2 -> P1 No deadlock P4 may release its instance of resource R2 Then it can be allocated to P3 Deadlocks-Galvin sonali C. CONT…

P1 -> R1 -> P3 -> R2 -> P1

No deadlock

P4 may release its instance of resource R2

Then it can be allocated to P3

If graph contains no cycles  no deadlock. If graph contains a cycle  if only one instance per resource type, then deadlock. if several instances per resource type, possibility of deadlock. RESOURCE-ALLOCATION GRAPH Deadlocks-Galvin sonali C. CONT…

If graph contains no cycles  no deadlock.

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 DEADLOCK We can deal with DL problem in 3-ways: Prevention/Avoidance Ensure that the system will never enter a deadlock state. Detection/Correction Allow system to enter a deadlock state and then recover. Ignorance Ignore problem and pretend that deadlocks never occur Used by most operating systems, including UNIX . Deadlocks-Galvin sonali C.

We can deal with DL problem in 3-ways:

Prevention/Avoidance

Ensure that the system will never enter a deadlock state.

Detection/Correction

Allow system to enter a deadlock state and then recover.

Ignorance

Ignore problem and pretend that deadlocks never occur

Used by most operating systems, including UNIX .

METHODS FOR HANDLING DEADLOCK Prevention Set of methods for ensuring that at least one of the condition cannot hold. Avoidance OS be given information about the resources request used in advance Deadlocks-Galvin sonali C. CONT…

Prevention

Set of methods for ensuring that at least one of the condition cannot hold.

Avoidance

OS be given information about the resources request used in advance

DEADLOCK PREVENTION Restrain the ways request can be made. Mutual Exclusion – not required for sharable resources; must hold for non-sharable resources. A printer cannot simultaneously shared by several process Deadlocks-Galvin sonali C.

Restrain the ways request can be made.

Mutual Exclusion – not required for sharable resources; must hold for non-sharable resources.

A printer cannot simultaneously shared by several process

DEADLOCK PREVENTION 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. Cons: Lower resource utilization Starvation Deadlocks-Galvin sonali C. CONT…

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.

Cons:

Lower resource utilization

Starvation

DEADLOCK PREVENTION 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. If process is requesting another resource, if it is available then it is given to requesting process If it is held by another process which is waiting for another resource, we release it n give it to requesting process. Deadlocks-Galvin sonali C. CONT…

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.

If process is requesting another resource, if it is available then it is given to requesting process

If it is held by another process which is waiting for another resource, we release it n give it to requesting process.

DEADLOCK PREVENTION Circular Wait – impose a total ordering of all resource types, and require that each process requests resources in an increasing order of enumeration. Deadlocks-Galvin sonali C. CONT…

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 Requires additional information about how resources are to be used. 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. Deadlocks-Galvin sonali C.

Requires additional information about how resources are to be used.

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, system must decide if immediate allocation leaves the system in a safe state. Systems is in safe state if there exists a safe sequence of all process A sequence < P 1 , P 2 , …, P n > of ALL the processes is the system such that for each P i , the resources that P i can still request can be satisfied by currently available resources + resources held by all the P j , with j < i . Deadlocks-Galvin sonali C.

When a process requests an available resource, system must decide if immediate allocation leaves the system in a safe state.

Systems is in safe state if there exists a safe sequence of all process

A sequence < P 1 , P 2 , …, P n > of ALL the processes is the system such that for each P i , the resources that P i can still request can be satisfied by currently available resources + resources held by all the P j , with j < i .

SAFE STATE That is: If P i resource needs are not immediately available, then P i can wait until all P j have finished. When P j is finished, P i can obtain needed resources, execute, return allocated resources, and terminate. When P i terminates, P i +1 can obtain its needed resources, and so on. Deadlocks-Galvin sonali C. CONT…

That is:

If P i resource needs are not immediately available, then P i can wait until all P j have finished.

When P j is finished, P i can obtain needed resources, execute, return allocated resources, and terminate.

When P i terminates, P i +1 can obtain its needed resources, and so on.

SAFE, UNSAFE DEADLOCK STATE If system is in safe state => No deadlock If system in not in safe state => possibility of deadlock OS cannot prevent processes from requesting resources in a sequence that leads to deadlock Avoidance => ensue that system will never enter an unsafe state, prevent getting into deadlock Deadlocks-Galvin sonali C. CONT…

If system is in safe state => No deadlock

If system in not in safe state => possibility of deadlock

OS cannot prevent processes from requesting resources in a sequence that leads to deadlock

Avoidance => ensue that system will never enter an unsafe state, prevent getting into deadlock

SAFE STATE - Example Suppose processes P0, P1, and P2 share 12 magnetic tape drives Currently 9 drives are held among the processes and 3 are available Question: Is this system currently in a safe state? Answer: Yes! Safe Sequence: <P1, P0, P2> Deadlocks-Galvin sonali C. CONT…

Suppose processes P0, P1, and P2 share 12 magnetic tape drives

Currently 9 drives are held among the processes and 3 are available

Question: Is this system currently in a safe state?

Answer: Yes!

Safe Sequence: <P1, P0, P2>

System in UNSAFE STATE Suppose process P2 requests and is allocated 1 more tape drive. Question: Is the resulting state still safe? Answer: No! Because there does not exist a safe sequence anymore. Only P1 can be allocated its maximum needs. IF P0 and P2 request 5 more drives and 6 more drives, respectively, then the resulting state will be deadlocked. Deadlocks-Galvin sonali C. CONT… 3

Suppose process P2 requests and is allocated 1 more tape drive.

Question: Is the resulting state still safe?

Answer: No! Because there does not exist a safe sequence anymore.

Only P1 can be allocated its maximum needs.

IF P0 and P2 request 5 more drives and 6 more drives, respectively, then the resulting state will be deadlocked.

SAFE STATE - DEADLOCK AVOIDANCE Key Ideas: Initially the system is in a safe state Whenever a process requests an available resource, system will allocate resource immediately only if the resulting state is still safe! Otherwise, requesting process must wait. Deadlocks-Galvin sonali C. CONT…

Key Ideas:

Initially the system is in a safe state

Whenever a process requests an available resource, system will allocate resource immediately only if the resulting state is still safe!

Otherwise, requesting process must wait.

DEADLOCK AVOIDANCE ALGORITHM Single instance of a resource type . Use a resource-allocation graph Cycles are necessary are sufficient for deadlock Multiple instances of a resource type. Use the banker’s algorithm Cycles are necessary, but not sufficient for deadlock Deadlocks-Galvin sonali C.

Single instance of a resource type .

Use a resource-allocation graph

Cycles are necessary are sufficient for deadlock

Multiple instances of a resource type.

Use the banker’s algorithm

Cycles are necessary, but not sufficient for deadlock

RESOURCE ALLOCATION GRAPH ALGORITHM Claim edge P i  R j indicates that process P j may request resource R j ; 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. Deadlocks-Galvin sonali C.

Claim edge P i  R j indicates that process P j may request resource R j ; 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.

RESOURCE ALLOCATION GRAPH ALGORITHM P2 requesting R1, but R1 is already allocated to P1. Both processes have a claim on resource R2 What happens if P2 now requests resource R2? Deadlocks-Galvin sonali C. CONT…

P2 requesting R1, but R1 is already allocated to P1.

Both processes have a claim on resource R2

What happens if P2 now requests resource R2?

UNSAFE STATE IN RESOURCE ALLOCATIONGRAPH ALGORITHM Cannot allocate resource R2 to process P2 Why? Because resulting state is unsafe P1 could request R2, thereby creating deadlock! Deadlocks-Galvin sonali C. CONT…

Cannot allocate resource R2 to process P2

Why? Because resulting state is unsafe

P1 could request R2, thereby creating deadlock!

RESOURCE ALLOCATION GRAPH ALGORITHM Use only when there is a single instance of each resource type Suppose that process P i requests a resource R j 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. Here we check for safety by using cycle-detection algorthim. Deadlocks-Galvin sonali C. CONT…

Use only when there is a single instance of each resource type

Suppose that process P i requests a resource R j

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.

Here we check for safety by using cycle-detection algorthim.

BANKER’S ALGORITHM RAL is not applicable for multiple instance of resource Bankers’ algorithm - Multiple instances. Each process claims maximum resource needs a priori . When a process requests a resource it may have to wait. When a process gets all of its resources it must return them in a finite amount of time. Deadlocks-Galvin sonali C.

RAL is not applicable for multiple instance of resource

Bankers’ algorithm - Multiple instances.

Each process claims maximum resource needs a priori .

When a process requests a resource it may have to wait.

When a process gets all of its resources it must return them in a finite amount of time.

BANKER’S ALGORITHM -Data structure 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 R j available. Max : n x m matrix. If Max [ i,j ] = k , then process P i may request at most k instances of resource type R j . Allocation : n x m matrix. If Allocation[ i,j ] = k then P i is currently allocated k instances of R j. Need : n x m matrix. If Need [ i,j ] = k , then P i may need k more instances of R j to complete its task. Need [ i,j] = Max [ i,j ] – Allocation [ i,j ]. Deadlocks-Galvin sonali C. CONT…

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 R j available.

Max : n x m matrix. If Max [ i,j ] = k , then process P i may request at most k instances of resource type R j .

Allocation : n x m matrix. If Allocation[ i,j ] = k then P i is currently allocated k instances of R j.

Need : n x m matrix. If Need [ i,j ] = k , then P i may need k more instances of R j to complete its task. Need [ i,j] = Max [ i,j ] – Allocation [ i,j ].

BANKER’S ALGORITHM - 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 and i such that both: (a) Finish [ i ] = false (b) Need i  Work If no such i exists, go to step 4. 3. Work = Work + Allocation i Finish [ i ] = true go to step 2. 4. If Finish [ i ] == true for all i , then the system is in a safe state. Deadlocks-Galvin sonali C. CONT…

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 and i such that both:

(a) Finish [ i ] = false

(b) Need i  Work

If no such i exists, go to step 4.

3. Work = Work + Allocation i Finish [ i ] = true go to step 2.

4. If Finish [ i ] == true for all i , then the system is in a safe state.

BANKER’S ALGORITHM - Resource Allocation Algorithm Request = request vector for process P i . If Request i [ j ] = k then process P i wants k instances of resource type R j . 1. If Request i  Need i go to step 2. Otherwise, raise error condition, since process has exceeded its maximum claim. 2. If Request i  Available , go to step 3. Otherwise P i must wait, since resources are not available. 3. Pretend to allocate requested resources to P i by modifying the state as follows: Available = Available – Request; Allocation i = Allocation i + Request i ; Need i = Need i – Request i ; If safe  the resources are allocated to Pi. If unsafe  Pi must wait, and the old resource-allocation state is restored Deadlocks-Galvin sonali C. CONT…

Request = request vector for process P i . If Request i [ j ] = k then process P i wants k instances of resource type R j .

1. If Request i  Need i go to step 2. Otherwise, raise error condition, since process has exceeded its maximum claim.

2. If Request i  Available , go to step 3. Otherwise P i must wait, since resources are not available.

3. Pretend to allocate requested resources to P i by modifying the state as follows:

Available = Available – Request;

Allocation i = Allocation i + Request i ;

Need i = Need i – Request i ;

If safe  the resources are allocated to Pi.

If unsafe  Pi must wait, and the old resource-allocation state is restored

BANKER’S ALGORITHM - Example 5 processes P 0 through P 4 ; 3 resource types: A (10 instances), B (5instances), and C (7 instances). Snapshot at time T 0 : Allocation Max Available A B C A B C A B C P 0 0 1 0 7 5 3 3 3 2 P 1 2 0 0 3 2 2 P 2 3 0 2 9 0 2 P 3 2 1 1 2 2 2 P 4 0 0 2 4 3 3 Deadlocks-Galvin sonali C. CONT…

5 processes P 0 through P 4 ;

3 resource types:

A (10 instances), B (5instances), and C (7 instances).

Snapshot at time T 0 :

Allocation Max Available

A B C A B C A B C

P 0 0 1 0 7 5 3 3 3 2

P 1 2 0 0 3 2 2

P 2 3 0 2 9 0 2

P 3 2 1 1 2 2 2

P 4 0 0 2 4 3 3

BANKER’S ALGORITHM - Example cont… The content of the matrix Need is defined to be Max – Allocation . Need A B C P 0 7 4 3 P 1 1 2 2 P 2 6 0 0 P 3 0 1 1 P 4 4 3 1 The system is in a safe state since the sequence < P 1 , P 3 , P 4 , P 2 , P 0 > satisfies safety criteria. Deadlocks-Galvin sonali C. CONT…

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

Need

A B C

P 0 7 4 3

P 1 1 2 2

P 2 6 0 0

P 3 0 1 1

P 4 4 3 1

The system is in a safe state since the sequence < P 1 , P 3 , P 4 , P 2 , P 0 > satisfies safety criteria.

BANKER’S ALGORITHM - Example cont…(P1 Request (1,0,2)) Check that Request  Available (that is, (1,0,2)  (3,3,2)  true . Allocation Need Available A B C A B C A B C P 0 0 1 0 7 4 3 2 3 0 P 1 3 0 2 0 2 0 P 2 3 0 1 6 0 0 P 3 2 1 1 0 1 1 P 4 0 0 2 4 3 1 Executing safety algorithm shows that sequence < P 1 , P 3 , P 4 , P 0 , P 2 > satisfies safety requirement. Can request for (3,3,0) by P 4 be granted? –NO Can request for (0,2,0) by P 0 be granted? –NO ( Results Unsafe) Deadlocks-Galvin sonali C. CONT…

Check that Request  Available (that is, (1,0,2)  (3,3,2)  true . Allocation Need Available

A B C A B C A B C

P 0 0 1 0 7 4 3 2 3 0

P 1 3 0 2 0 2 0

P 2 3 0 1 6 0 0

P 3 2 1 1 0 1 1

P 4 0 0 2 4 3 1

Executing safety algorithm shows that sequence < P 1 , P 3 , P 4 , P 0 , P 2 > satisfies safety requirement.

Can request for (3,3,0) by P 4 be granted? –NO

Can request for (0,2,0) by P 0 be granted? –NO ( Results Unsafe)

DEADLOCK DETECTION Allow system to enter deadlock state Detection algorithm Recovery scheme Deadlocks-Galvin sonali C.

Allow system to enter deadlock state

Detection algorithm

Recovery scheme

Resource-Allocation Graph and Wait-for Graph For single instance P i -> P j (P i is waiting for P j to release a resource that P i needs) P i -> P j exist if and only if RAG contains 2 edges P i -> R q and R q -> P j for some resource R q Deadlocks-Galvin sonali C. Resource-Allocation Graph Corresponding wait-for graph

For single instance

P i -> P j (P i is waiting for P j to release a resource that P i needs)

P i -> P j exist if and only if RAG contains 2 edges P i -> R q and R q -> P j for some resource R q

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 [ i j ] = k , then process P i is requesting k more instances of resource type. R j . Deadlocks-Galvin sonali C.

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 P i is requesting k more instances of resource type. R j .

Detection Algorithm Let Work and Finish be vectors of length m and n , respectively Initialize: (a) Work = Available (b) For i = 1,2, …, n , if Allocation i  0, then Finish [i] = false;otherwise, Finish [i] = true . 2. Find an index i such that both: (a) Finish [ i ] == false (b) Request i  Work If no such i exists, go to step 4. Deadlocks-Galvin sonali C.

Let Work and Finish be vectors of length m and n , respectively Initialize:

(a) Work = Available

(b) For i = 1,2, …, n , if Allocation i  0, then Finish [i] = false;otherwise, Finish [i] = true .

2. Find an index i such that both:

(a) Finish [ i ] == false

(b) Request i  Work

If no such i exists, go to step 4.

Work = Work + Allocation i 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 P i is deadlocked. Deadlocks-Galvin sonali C.

Work = Work + Allocation i 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 P i is deadlocked.

Example of Detection Algorithm Five processes P 0 through P 4 ; three resource types A (7 instances), B (2 instances), and C (6 instances). Snapshot at time T 0 : Allocation Request Available A B C A B C A B C P 0 0 1 0 0 0 0 0 0 0 P 1 2 0 0 2 0 2 P 2 3 0 3 0 0 0 P 3 2 1 1 1 0 0 P 4 0 0 2 0 0 2 Sequence < P 0 , P 2 , P 3 , P 1 , P 4 > will result in Finish [ i ] = true for all i . Deadlocks-Galvin sonali C.

Five processes P 0 through P 4 ; three resource types A (7 instances), B (2 instances), and C (6 instances).

Snapshot at time T 0 :

Allocation Request Available

A B C A B C A B C

P 0 0 1 0 0 0 0 0 0 0

P 1 2 0 0 2 0 2

P 2 3 0 3 0 0 0

P 3 2 1 1 1 0 0

P 4 0 0 2 0 0 2

Sequence < P 0 , P 2 , P 3 , P 1 , P 4 > will result in Finish [ i ] = true for all i .

P 2 requests an additional instance of type C . Request A B C P 0 0 0 0 P 1 2 0 1 P 2 0 0 1 P 3 1 0 0 P 4 0 0 2 State of system? Can reclaim resources held by process P 0 , but insufficient resources to fulfill other processes; requests. Deadlock exists, consisting of processes P 1 , P 2 , P 3 , and P 4 . Deadlocks-Galvin sonali C.

P 2 requests an additional instance of type C .

Request

A B C

P 0 0 0 0

P 1 2 0 1

P 2 0 0 1

P 3 1 0 0

P 4 0 0 2

State of system?

Can reclaim resources held by process P 0 , but insufficient resources to fulfill other processes; requests.

Deadlock exists, consisting of processes P 1 , P 2 , P 3 , and P 4 .

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 Deadlocks-Galvin sonali C.

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? Priority of the process. How long process has computed, and how much longer to completion. Resources the process has used. Resources process needs to complete. How many processes will need to be terminated. Is process interactive or batch? Deadlocks-Galvin sonali C.

Abort all deadlocked processes.

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

In which order should we choose to abort?

Priority of the process.

How long process has computed, and how much longer to completion.

Resources the process has used.

Resources process needs to complete.

How many processes will need to be terminated.

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. Deadlocks-Galvin sonali C.

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 All The Best Deadlocks-Galvin sonali C.

Add a comment

Related presentations

Related pages

Operating Systems: Deadlocks - UIC - Computer Science

Deadlocks References: Abraham Silberschatz, Greg Gagne, and Peter Baer Galvin, "Operating System Concepts, Ninth Edition ", Chapter 7 7.1 System Model
Read more

Chapter 8: Deadlocks - Wiley: Home

Operating System Concepts 8.1 Silberschatz, Galvin and Gagne 2002 Chapter 8: Deadlocks System Model Deadlock Characterization Methods for Handling ...
Read more

Chapter 8: Deadlocks - George Mason University

1 Operating System Concepts with Java 8.1 Silberschatz, Galvin and Gagne ©2003 Chapter 8: Deadlocks nSystem Model nDeadlock Characterization nMethods for ...
Read more

Chapter 7: Deadlocks - Université de Montréal

Operating System Concepts – 9th Edition! 7.2! Silberschatz, Galvin and Gagne ©2013! Chapter 7: Deadlocks System Model" Deadlock Characterization"
Read more

Chapter 7: Deadlocks - EazyNotes

Operating System Concepts – 8th Edition 1.2 Silberschatz, Galvin and Gagne ©2009 Chapter 7: Deadlocks The Deadlock Problem System Model Deadlock ...
Read more

Chapter 7: Deadlocks - Louisiana Tech University

Operating System Concepts! 7.2! Silberschatz, Galvin and Gagne ©2005! Chapter 7: Deadlocks! The Deadlock Problem" System Model" Deadlock ...
Read more

OPERATING SYSTEMS DEADLOCKS - Computer Science

OPERATING SYSTEMS DEADLOCKS. 7: Deadlocks 2 What Is In This Chapter? ... == true for all i, then the system is in a safe state. DEADLOCKS Deadlock Avoidance
Read more

Silberschatz, Galvin and Gagne ©2013 Operating System ...

Silberschatz, Galvin and Gagne ©2013 Operating System Concepts – 9 th Edition Chapter 7: Deadlocks.
Read more

Operating System Concepts - slides - Yale University

Operating System Concepts Ninth Edition Avi Silberschatz Peter Baer Galvin Greg Gagne. We provide a set of slides to accompany each chapter.
Read more