1. Operating Systems (CS 340 D) Princess Nora University Faculty of Computer & Information Systems Computer science Department

2. (Chapter-7) Deadlocks

3. Chapter 7: Deadlocks 1.The Deadlock Problem 2.Deadlock Characterization 3.Methods for Handling Deadlocks 3

4. OBJECTIVES :  To develop a description of deadlocks, which prevent sets of concurrent processes from completing their tasks  To present methods for Handling Deadlocks 4

5. The Deadlock Problem 5

6.  In a multiprogramming environment, several processes may compete for a finite number of resources.  A process requests resources; if the resources are not available at that time, the process enters a waiting state.  Sometimes, a waiting process is never again able to change state, because the resources it has requested are held by other waiting processes. This situation is called a DEADLOCK. 6

7.  What is a deadlock problem?? o A set of blocked processes each holding a resource and waiting to acquire a resource held by another process in the set  Example o System has 2 disk drives o P 1 and P 2 each hold one disk drive and each need the other one  Note :– Most OSs do not prevent or deal with deadlocks The Deadlock Problem (cont..) 7

8. Bridge Crossing 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 8

9. System Model  The resources are partitioned into several types (R 1, R 2,..., R m ) o E.g.: CPU cycles, memory space, I/O devices  Each resource type R i has W i instances. o E.g :  If a system has (2) CPUs, then the resource type CPU has (2) instances.  The resource type printer may have (5) instances. 9 Instances are identical

10. 10  Each process utilizes a resource as follows: 1. Request >> If the request cannot be granted immediately,then the requesting process must wait until it can acquire the resource. 2. Use 3. Release  A set of processes is in a deadlocked state when every process in the set is waiting for an event that can be caused only by another process in the set.

11. System Model (cont.)  Resource forms:  Example:  consider a system with one printer and one DVD drive. Suppose that process Pi is holding the DVD and process Pj is holding the printer. If Pi requests the printer and Pj requests the DVD drive, a deadlock occurs. 11 Physical resources Logical resources e.g. printers, DVD drives, memory space, and CPU cycles e.g. files

12. The Deadlock Characterization 12

13. Deadlock Characterization 1. Mutual exclusion: the resources are sharable or non sharable  mutual exclusion happen when only one process at a time can use a resource…(i.e. No resource sharing) 2. Hold and wait: a process holding at least one resource is waiting to acquire additional resources held by other processes Deadlock can arise if four conditions hold simultaneously: 13

14. Deadlock Characterization (cont..) 3. No preemption: a resource can be released only voluntarily by the process holding it, after that process has completed its task 4. Circular wait:  There exists a set {P 0, P 1, …, P n } of waiting processes such that : o P 0 is waiting for a resource that is held by P 1, o 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, o P n is waiting for a resource that is held by P 0. 14 P0P0 P1P1 P2P2 PnPn

15. Resource-Allocation Graph 15

16. Resource-Allocation Graph  Deadlocks can be described in terms of a directed graph called a system resource-allocation graph.  This graph consists of a set of vertices V and a set of edges E. 16 V is partitioned into two types: E is partitioned into two types: P = {P 1, P 2, …, P n }, the set consisting of all the processes in the system Request edge – directed edge P i  R j R = {R 1, R 2, …, R m }, the set consisting of all resource types in the system Assignment edge – directed edge R j  P i

17. Resource-Allocation Graph (Cont.)  Process  Resource Type with 4 instances  P i requests instance of R j  P i is holding an instance of R j PiPi PiPi RjRj RjRj 17

18. Example of a Resource Allocation Graph n The sets P, R, and E:  P = {P1, P2, P3}  R = {R1, R2, R3, R4}  E = {P1 → R1, P2 → R3, R1 → P2, R2 → P2, R2 → P1, R3 → P3} n Resource instances:  (1) instance of resource type R1  (2) instances of resource type R2  (1) instance of resource type R3  ( 3) instances of resource type R4 18

19. Example of a Resource Allocation Graph n Process states:  Process P1 is holding an instance of resource type R2 and is waiting for an instance of resource type R1.  Process P2 is holding an instance of R1 and an instance of R2 and is waiting for an instance of R3.  Process P3 is holding an instance of R3. 19

20. Basic Facts  How we recognize deadlock by using a Resource Allocation Graph??  If graph contains no cycles  no deadlock  If graph contains a cycle   If only one instance per resource type, then there is a deadlock  If several instances per resource type, possibility of deadlock. 20

21. Resource Allocation Graph With NO Deadlock n Example (1): l The graph contains NO cycles  NO deadlock is occurred. 21

22. l It ‘s a dead lock situation >>> Processes P1, P2, and P3 are deadlocked…….why??  There is no chance to break the cycle. Resource Allocation Graph With a Deadlock 22 n Example (2): l The graph contains (2)cycles  may be a deadlock is occurred.  Cycle (1) : P1 → R1 → P2 → R3 → P3 → R2 → P1  Cycle (2) : P2 → R3 → P3 → R2 → P2

23. Graph With A Cycle But No Deadlock l NO dead lock situation.....WHY????  process P4 may release its instance of resource type R2…… That resource can then be allocated to P3, breaking the cycle. 23 n Example (3): l The graph contains (1)cycle  may be a deadlock Cycle : P1 → R1 → P3 → R2 → P1

24. Methods for Handling Deadlocks 24

25. Methods for Handling Deadlocks  OS can deal with the deadlock problem in one of three ways 25 1-prevent or avoid deadlocks 2-Allow3-Ignore ensuring that the system will never enter a deadlocked state. Allow the system to enter a deadlocked state, detect it, and recover. Ignore the problem  Used by most operating systems, including Unix & windows  This method is cheaper than 1 or 2.  Solution: The system must be restarted manually

26. 26  To ensure that deadlocks never occur, the system can use either 1. a deadlock prevention or 2. a deadlock-avoidance scheme Method (1) for Handling Deadlocks

27. 27 Deadlock preventionDeadlock avoidance provides a set of methods to ensure that at least one of the necessary 4 conditions (explained before ) cannot hold. These methods prevent deadlocks by constraining how requests for resources can be made. requires that the operating system be given additional information in advance concerning which resources a process will request and use during its lifetime. With this additional knowledge, the operating system can decide for each request whether or not the process should wait. Method(1) for Handling Deadlocks

28. 1-Deadlock Prevention 28

29. Deadlock Prevention 1- Mutual Exclusion – not required for sharable resources; must hold for non- sharable resources.  That is, at least one resource must be nonsharable. Sharable resources, in contrast, do not require mutually exclusive access and thus cannot be involved in a deadlock 2- Hold and Wait – must guarantee that whenever a process requests a resource, it does not hold any other resources by using one of the following protocols: Problems-> Low resource utilization; starvation possible Remove the possibility of deadlock occurring by denying one of the four necessary conditions: The process must request all its resources before execution. or allow process to request resources only when the process has none 29

30. Deadlock Prevention (Cont.) 3- 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  Process will be restarted only when it can regain its old resources, as well as the new ones that it is requesting  It is applied to resources whose state easily saved and restored later, such as CPU registers and memory space but it not applicable for resources such as printers  The main Advantages is more better resource utilization  Problems The cost of removing a process's resources starvation possible It is not applicable for all resource types such as printers 30

31. 31  One way to ensure that this condition never holds is to impose a total ordering of all resource types and to require that each process requests resources in an increasing order of enumeration.  let R = {R1, R2,..., Rm} be the set of resource types. We assign to each resource type a unique integer number, which allows us to compare two resources and to determine whether one precedes another in our ordering.  Formally, we define a one-to-one function F: R → N, where N is the set of natural numbers. 4- Circular Wait –

32. Deadlock Prevention (Cont.)  Example : if the set of resource types R includes tape drives, disk drives, and printers,  then the function F might be defined as follows: F(tape drive) = 1 F(disk drive) = 5 F(printer) = 12  We can now consider the following protocol to prevent deadlocks:  Each process can request resources only in an increasing order of enumeration.  That is, a process can initially request any number of instances of a resource type —say, Ri. After that, the process can request instances of resource type Rj if and only if F(Rj ) > F(Ri ). …………..(Protocol#1) 4- Circular Wait – cont.. 32

33. Deadlock Prevention (Cont.)  EX: a process that wants to use the tape drive and printer at the same time must first request the tape drive and then request the printer.  Alternatively, we can require that a process requesting an instance of resource type Rj must have released any resources Ri such that F(Ri ) ≥ F(Rj ). …..(Protocol#2)  Problems Resources must be requested in ascending order of resource number rather than as needed 4- Circular Wait – cont.. 33

34. 2-Deadlock Avoidance 34

35. 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 Requires that the system has some additional a priori information available 35

36. 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 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 o That is: If Pi resource needs are not immediately available, then Pi can wait until all Pj have finished o When Pj is finished, Pi can obtain needed resources, execute, return allocated resources, and terminate o When Pi terminates, Pi +1 can obtain its needed resources, and so on 36

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

38. Safe, Unsafe, Deadlock State 38

39. Avoidance algorithms The avoidance algorithms ensure that the system will always remain in a safe state.  Single instance of a resource type  Use a resource-allocation graph  Multiple instances of a resource type  Use the banker’s algorithm 39

40. Resource-Allocation Graph Scheme  Claim edge P i → R j indicated 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 40

41. Resource-Allocation Graph 41

42. Unsafe State In Resource-Allocation Graph 42

43. Resource-Allocation Graph Algorithm 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 form of a cycle in the resource allocation graph 43

44. 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  Banker's Algorithm consist of (2) sub-algorithms: o Safety algorithm o Recourse-Request Algorithm  44

45. Banker’s Algorithm  When a new process enters the system, it must declare the maximum number of instances of each resource type that it may need. This number may not exceed the total number of resources in the system.  When a process requests a set of resources, the system must determine whether the allocation of these resources will leave the system in a safe state. o If it will, the resources are allocated; o otherwise, the process must wait until some other process releases enough resources. 45

46. Data Structures for the Banker’s Algorithm 46 nAvailable: Vector of length m. If available [j] = k, there are k instances of resource type Rj available nMax: n x m matrix. If Max [i,j] = k, then process Pi may request at most k instances of resource type Rj nAllocation: n x m matrix. If Allocation[i,j] = k then Pi is currently allocated k instances of Rj nNeed: 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] Let n = number of processes, and m = number of resources types.

47. Safety Algorithm 47 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 any 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

48. 48 Resource-Request Algorithm for Process Pi  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 ; lIf safe  the resources are allocated to Pi lIf unsafe  Pi must wait, and the old resource-allocation state is restored

49. Example of Banker’s Algorithm  A system with 5 processes (p 0,p 1,p 2,p 3,p 4 ), 3 resource types )A,B,C) with instances (10,5,7)  Snapshot at time T 0 : AllocationMax need ABCABC P0010753 P1200322 P2302902 P3211222 p4002433

50. Example of Banker’s Algorithm (Cont.) AllocationMAXNeedAvailable ABCABCABCABC P0010753743332 P1200322122 P2302902600 P3211222011 p4002433431 -Is system now in safe state? - If a request R 1 = (1,0,2) arrive, Can this request be granted immediately?

51. Example of Banker’s Algorithm (Cont.) AllocationMAXNeedAvailable ABCABCABCABC P0010753743 230 P1302 322 020 P2302902600 P3211222011 p4002433431 - Calculate new state after granting request R 1 = (1,0,2)

52. Example of Banker’s Algorithm (Cont.) - If a request R 4 = (3,3, 0) arrive, Can this request be granted immediately? - If a request R 0 = (0,2, 0) arrive, Can this request be granted immediately? - If a request R 3 = (1, 1, 1) arrive, Can this request be granted immediately? AllocationMAXNeedAvailable ABCABCABCABC P0010753743230 P1302322020 P2302902600 P3211222011 p4002433431

53. Thank you End of Chapter 7 53