Chapter 7 Deadlocks

Chapter 7 Deadlocks

Chapter 7: Deadlocks • System Model • Deadlock Characterization • Methods for Handling Deadlocks • Deadlock Prevention • Deadlock Avoidance • Deadlock Detection • Recovery from Deadlock

System Model §7.1 • A system consists of a finite number of resources to be distributed among competing processes. • Resources are partitioned into several types, each of which consists of multiple identical instances. CPU cycles, memory space, files, I/O devices, object locks

System Model • Each process utilizes a resource as following sequence: • request • If the request cannot be granted immediately, then the requesting process must wait until it can acquire the resource. • use • The process can operate on the resource. • release • The process releases the resource.

Deadlock Characterization §7.2 • 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, …, P0} 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. Deadlock can arise if four conditions hold simultaneously.

Resource-Allocation Graph §7.2.2 • V is partitioned into two types of nodes: • P = {P1, P2, …, Pn}, the set consisting of all the processes in the system. • 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 A set of vertices V and a set of edges E.

Resource-Allocation Graph • Process • Resource Type with 4 instances • Pirequests instance of Rj • Pi is holding an instance of Rj • A request edge points to only the square Rj, whereas an assignment edge must also designate one of the dots in the square. Pi Rj Pi Rj

Resource Allocation Graph Example:

Resource Allocation Graph Deadlocked:

Resource Allocation Graph With Cycle but No Deadlock:

Basic Facts • 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 Deadlocks §7.3 • Use a protocol to ensure that the system will never enter a deadlock state. • Allow the system to enter a deadlock state and then recover. The system can provide an algorithm that examines the state of the system to determine whether a deadlock has occurred, and an algorithm to recover from the deadlock. Deadlock Prevention: (§8.4) a set of methods for ensuring that at least one of the necessary conditions cannot hold. Deadlock avoidance: (§8.5) give OS information about processes and resources for the decision of satisfying or delaying the requests. Deadlock Detection: (§8.5) • Ignore the problem and pretend that deadlocks never occur in the system. Deadlock Recovery: (§8.7)

Methods for Handling Deadlocks • If no prevention, no avoidance, no detection and no recovery schemes, then the system may reach a deadlock state and eventually need to be restarted manually. • Although does not seem to be viable, it is used in most OS, including UNIX. • In many systems, deadlocks occur infrequently; thus it is cheaper to use this method. • JVM does nothing to manage deadlocks, it is up to the application developer to write programs that are deadlock-free.

Deadlock Prevention §7.4 • By ensuring that at least one of the conditions (§8.2) cannot hold, we can prevent the occurrence of a deadlock. • Mutual Exclusion – not required for sharable resources, but must hold for nonsharable resources (printers, synchronized method)

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… release all the resources that is is currently allocated before requesting additional resources. • Low resource utilization; starvation possible.

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… release all the resources that is currently allocated before requesting additional resources. • Low resource utilization; starvation possible.

Deadlock Prevention (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. • Often applied to resources whose state can be easily saved and restored later, such as CPU registers and memory space. It cannot be applied to resources such as printers and tape drives.

Deadlock Prevention (Cont.) • Circular Wait – impose a total ordering of all resource types, and require that each process requests resources in an increasing order of enumeration.Let R={R1,R2, …, Rm} be the set of resource types.F:R→NF(type drive) =1F(disk drive) = 5F(printer) = 12A process owning resource type Ri can continue to request type Rj iff F(Rj)>F(Ri)orWhenever a process requests an instance of resource type Rj, it has released any resources Ri such that F(Ri) >=F(Rj). Should be defined according to the normal order of usage of the resources in a system.

Proof by contradiction • Assume circular wait exists in {P0, P1, ..., Pn}, where Pi is waiting for a resource Ri, which is held by process Pi+1. • F(Ri) < F(Ri+1)=>F(R0) < F(R1) < ... <F(Rn) <F(R0)=> F(R0) < F(R0) Impossible

Deadlock Avoidance §7.5 Requires that the system has some additional a priori information available. • 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 §7.5.1 • A state is safe if the system can allocate resources to each process in some order and still avoid a deadlock. • Safe sequence <P1, P2, ..., Pn> :if, for each Pi, the resources that Pi can still request can be safisfied by the currently available resources plus the resources held by all the Pj with j < i. • If no such sequence exists, then the system is said to be unsafe.

Safe State • A safe state is not a deadlock state. • A deadlock state is an unsafe state. • Not all unsafe states are deadlocks. • An unsafe state may lead to a deadlock. • In unsafe state, OS cannot prevent processes from requesting resources and cause deadlock: the behavior of the processes controls unsafe state.

Safe State • Example: 12 tape drives, 3 processes.max needscurrent holdingP0 10 5P1 4 2P2 9 2 • Safe for <P1,P0,P2> • If P2 request one more, system go into unsafe state.

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.

Resource-Allocation Graph Algorithm §7.5.2 • Claim edgePi Rj indicated that process Pi may request resource Rj at some time in the future. It is represented by a dashed line. • Claim edge converts to request edge when a process requests a resource. • When the resource is allocated to the process, assignment edge is added. • When a resource is released by a process, assignment edge reconverts to a claim edge. R1 P1

Safe State • A request can be granted only if converting the request edge to assignment edge does not result in the formation of a cycle in the resource-allocation graph. • If no cycle exists, then the allocation of the resource will leave the system in a safe state. Otherwise, process have to wait.

Banker’s Algorithm (From SHAY) §7.5.3 • 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.

Example 1 Maximum Number of pages needed Current Number of pages allocated Process 1 2 4 Process 2 3 6 Process 3 1 6 Process 4 4 8 14 pages in the system 4 pages are unallocated • Safe • Process 1,2, or 4 could request its maximum number of pages and finish • For example: process 1 finish

Example 1 Maximum Number of pages needed Current Number of pages allocated Process 1 2 4 Process 2 3 6 Process 3 1 6 Process 4 4 8 14 pages in the system 6 pages are unallocated • Now any process could request pages up to its maximum and finish • Suppose process 3 finish

Example 1 Maximum Number of pages needed Current Number of pages allocated Process 1 2 4 Process 2 3 6 Process 3 1 6 Process 4 4 8 14 pages in the system 7 pages are unallocated • Any one can finish. • However, a sequence of requests that allowed all processes to finish does not indicate a safe state.

Example 1 Maximum Number of pages needed Current Number of pages allocated Process 1 2 4 Process 2 3 6 Process 3 1 5 6 Process 4 4 8 14 pages in the system 0 pages are unallocated • If process 3 requests the 4 available pages, and each process subsequently requests 1 more page, the system is deadlocked • However, it doesn't necessarily occur. ....A unsafe state doesn't mean that the deadlock will occur inevitably.

Example 2 Current Number of pages allocated Maximum Number of pages needed Process 1 1 2 Process 2 2 4 Process 3 2 7 Process 4 1 6 7 pages in the system 1 pages are unallocated

Example 2 Current Number of pages allocated Maximum Number of pages needed Process 1 1 2 Process 2 2 4 Process 3 2 7 Process 4 1 6 7 pages in the system 1 pages are unallocated Process 1 1 2 Process 2 2 4 Process 3 2 7 Process 4 1 6 7 pages in the system 2 pages are unallocated

Example 2 Current Number of pages allocated Maximum Number of pages needed Process 1 1 2 Process 2 2 4 Process 3 2 7 Process 4 1 6 7 pages in the system 1 pages are unallocated Process 1 1 2 Process 2 2 4 Process 3 2 7 Process 4 1 6 7 pages in the system 2 pages are unallocated Process 1 1 2 Process 2 2 4 Process 3 2 7 Process 4 1 6 7 pages in the system 4 pages are unallocated • If each process asserts its claim, deadlock will occur • Unsafe !

Banker’s Algorithm §7.5.3 • Safe state. <P1, P3, P4, P2, P0> • If request1=(1,0,2) Need A B C Allocation Max Available A B C A B C A B C P0 7 4 3P1 1 2 2 P2 6 0 0 P3 0 1 1 P4 4 3 1 P0 0 1 0 7 5 3 3 3 2P1 2 0 0 3 2 2 P2 3 0 2 9 0 2 P3 2 1 1 2 2 2 P4 0 0 2 4 3 3

Banker’s Algorithm §7.5.3 • Safe state. <P1, P3, P4, P2, P0> • If request1=(1,0,2) • Still safe with < P1, P3, P4, P0, P2 > Need A B C Allocation Max Available A B C A B C A B C P0 7 4 3P1 0 2 0 P2 6 0 0 P3 0 1 1 P4 4 3 1 P0 0 1 0 7 5 3 2 3 0P1 3 0 2 3 2 2 P2 3 0 2 9 0 2 P3 2 1 1 2 2 2 P4 0 0 2 4 3 3

Banker’s Algorithm §7.5.3 • Safe state. <P1, P3, P4, P2, P0> • Request4=(3,3,0) Need A B C Allocation Max Available A B C A B C A B C P0 7 4 3P1 1 2 2 P2 6 0 0 P3 0 1 1 P4 4 3 1 P0 0 1 0 7 5 3 3 3 2P1 2 0 0 3 2 2 P2 3 0 2 9 0 2 P3 2 1 1 2 2 2 P4 0 0 2 4 3 3

Banker’s Algorithm §7.5.3 • Safe state. <P1, P3, P4, P2, P0> • Request4=(3,3,0) • Cannot be granted. No resources. Need A B C Allocation Max Available A B C A B C A B C P0 7 4 3P1 1 2 2 P2 6 0 0 P3 0 1 1 P4 1 0 1 P0 0 1 0 7 5 3 0 0 2P1 2 0 0 3 2 2 P2 3 0 2 9 0 2 P3 2 1 1 2 2 2 P4 3 3 2 4 3 3

Banker’s Algorithm §7.5.3 • Safe state. <P1, P3, P4, P2, P0> • Request0 =(0,2,0) Need A B C Allocation Max Available A B C A B C A B C P0 7 4 3P1 1 2 2 P2 6 0 0 P3 0 1 1 P4 4 3 1 P0 0 1 0 7 5 3 3 3 2P1 2 0 0 3 2 2 P2 3 0 2 9 0 2 P3 2 1 1 2 2 2 P4 0 0 2 4 3 3

Banker’s Algorithm §7.5.3 • Safe state. <P1, P3, P4, P2, P0> • Request0 =(0,2,0) • Will result in unsafe state. Need A B C Allocation Max Available A B C A B C A B C P0 7 2 3P1 1 2 2 P2 6 0 0 P3 0 1 1 P4 4 3 1 P0 0 3 0 7 5 3 3 1 2P1 2 0 0 3 2 2 P2 3 0 2 9 0 2 P3 2 1 1 2 2 2 P4 0 0 2 4 3 3

Deadlock Detection §7.6 • Allow system to enter deadlock state • System should provide: • An algorithm that examines the state of the system to determine whether a deadlock has occurred. • An algorithm to recover from the deadlock. • It requires overhead that includes • maintaining necessary information • executing the detection algorithm • potential losses when recovering

Single Instance of Each Resource Type §7.6.1 • Maintain wait-for graph: obtained from the resource-allocation graph by removing the nodes of type resource and collapsing the appropriate edges. • Nodes are processes. • Pi Pj if Piis waiting for Pj. to release a resource that Pi needs. • Needs to maintain the wait-for graph and periodically invoke an algorithm that searches for a cycle in the graph. • An algorithm to detect a cycle in a graph requires an order of O(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 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 deadlocks occur frequently, then the detection algorithm should be invoked frequently. • In the extreme, we could invoke the deadlock-detection algorithm every time a request for allocation cannot be granted immediately. Expensive

Detection-Algorithm Usage • Less expensive alternative:invoke the algorithm at less frequent intervals. • 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.

Several Instances of a Resource Type §7.6.2 • Not deadlocked. <P0, P2, P3, P1, P4> • If P2 make request (0, 0, 1), Deadlocked between P1, P2, P3, P4. Allocation Request Available A B C A B C A B C P0 0 1 0 0 0 0 0 0 0P1 2 0 0 2 0 2 P2 3 0 3 0 0 0 P3 2 1 1 1 0 0 P4 0 0 2 0 0 2

Several Instances of a Resource Type §7.6.2 • Not deadlocked. <P0, P2, P3, P1, P4> • If P2 make request (0, 0, 1), Deadlocked between P1, P2, P3, P4. Allocation Request Available A B C A B C A B C P0 0 1 0 0 0 0 0 0 0P1 2 0 0 2 0 2 P2 3 0 3 0 0 1 P3 2 1 1 1 0 0 P4 0 0 2 0 0 2

Recovery from Deadlock: Process Termination §7.7 • Abort all deadlocked processes. • Expensive to discard and re-compute partial computation. • Abort one process at a time until the deadlock cycle is eliminated. • overhead for invoking deadlock-detection algorithm after each process is aborted.

Chapter 7 Deadlocks