2. 1 Deadlocks Chapter 3 3.1. Resource 3.2. Introduction to deadlocks 3.4. Deadlock detection and recovery 3.5. Deadlock avoidance 3.6. Deadlock prevention 3.7. Other issues

3. 2 Resources Preemptable –can be taken away from a process with no ill effects Non-preemptable resources –will cause the process to fail if taken away Examples of computer resources –Memory is preemptable. However if we enforce exclusive access like in critical section it becomes non-preemptable. –Printers non-preemptable. –CD write non-preemptable.

4. 3 Examples of non-preemptable resources typedef int semaphore; semaphore resource_1; semaphore resource_2; void process_A( ) { down(&resource_1); down(&resource_2); /* use both resources */ up(&resource_2); up(&resource_1); } void process_B( ) { down(&resource_1); down(&resource_2); /* use both resources */ up(&resource_2); up(&resource_1); } typedef int semaphore; semaphore resource_1; semaphore resource_2; void process_A( ) { down(&resource_1); down(&resource_2); /* use both resources */ up(&resource_2); up(&resource_1); } void process_B( ) { down(&resource_2); down(&resource_1); /* use both resources */ up(&resource_1); up(&resource_2); } a. Deadlock-free b. Potential deadlock

5. 4 Sequence of resource usage 1.request the resource if request is denied requesting process may wait (in a semaphore) 2.use the resource 3.release the resource

6. 5 Four Conditions for Deadlock 1.Mutual exclusion condition resource is either assigned or available 2.Hold and wait condition holding process can request additional resources 3.No preemption condition assigned resource cant be shared 4.Circular wait condition each process is waiting for resource held by the other process which is member of the chain None of the processes involved in deadlock can run release resources be awakened Formal definition : A set of processes is deadlocked if each process in the set is waiting for an event that only another process in the set can cause

7. 6 Strategies for dealing with Deadlocks 1.Detection and recovery 2.Dynamic avoidance careful resource allocation 3.Prevention negating one of the four necessary conditions

8. 7 Deadlock Modeling Modeled with directed graphs –resource R assigned to process A –process B is requesting/waiting for resource S –process C and D are in deadlock over resources T and U

9. 8 A B C How deadlock occurs

10. 9 Deadlock avoided by process scheduling (o) (p) (q) A Request R Request S Release R Release S B Request S Request T Release S Release T C Request T Request R Release T Release R

11. 10 Modeling with directed graphs Processes: a, b, c, d, e, f, g. Resources: R, S, T, U, V, W. 1.process a holds R and wants S 2.process b holds nothing but wants T 3.process c holds nothing but wants S 4.process d holds U and wants S and T 5.process e holds T and wants V 6.process f holds W and wants S 7.process g holds V and wants U

12. 11 Detection with One Resource of Each Type A cycle within the graph denotes deadlock R a S c f e b d g UV T W e d g UV T

13. 12 Algorithm searching for loops 1.Initialize empty list of nodes and make a list of unmarked arcs. 2.Add (first) node to the list. If the node already exist this is the cycle. End. 3.Follow unmarked outgoing arc from the node and add next node to the list. In the list of arcs check the outgoing arc. Go to step 2. If there is no unmarked outgoing arc go to 4. 4. Mark this node and go to the previous node in the list. 5. If all nodes are marked loop is not found.

14. 13 Detection for multiple resources of each type   C ij + A j = E j i = 1 n Definition: vector A <= vector B iff A i <= B i for all i

15. 14 Algorithm 1.Look for unmarked process (row) Pi for which R i <= A i. 2.If such process is found A <- A + R, mark the process, and go to step 1. 3.If all processes are marked there is no deadlock

16. 15 An example for the deadlock detection algorithm

17. 16 Recovery from Deadlock Recovery through preemption –take a resource from some other process –depends on nature of the resource Recovery through rollback –checkpoint a process periodically –use this saved state –restart the process if it is found deadlocked Recovery through killing processes –crudest but simplest way to break a deadlock –kill one of the processes in the deadlock cycle –the other processes get its resources –choose process that can be rerun from the beginning

18. 17 Deadlock Avoidance Two process resource trajectories

19. 18 Safe and Unsafe States (1) Demonstration that the state in (a) is safe (a) (b) (c) (d) (e)

20. 19 Safe and Unsafe States (2) Demonstration that the sate in b is not safe (a) (b) (c) (d)

21. 20 The Banker's Algorithm for a Single Resource Three resource allocation states –safe –unsafe (a) (b) (c)

22. 21 Banker's Algorithm for Multiple Resources Example of banker's algorithm with multiple resources

23. 22 Deadlock Prevention Attacking the Mutual Exclusion Condition Some devices (such as printer) can be spooled –only the printer daemon uses printer resource –thus deadlock for printer eliminated Not all devices can be spooled Principle: –avoid assigning resource when not absolutely necessary –as few processes as possible actually claim the resource

24. 23 Attacking the Hold and Wait Condition Require processes to request resources before starting –a process never has to wait for what it needs Problems –may not know required resources at start of run –also ties up resources other processes could be using Variation: –process must give up all resources –then request all immediately needed

25. 24 Attacking the No Preemption Condition This is not a viable option Consider a process given the printer –halfway through its job –now forcibly take away printer –!!??

26. 25 Attacking the Circular Wait Condition (1) Normally ordered resources A resource graph (a) (b)

27. 26 Attacking the Circular Wait Condition (1) Summary of approaches to deadlock prevention

28. 27 Other Issues Two-Phase Locking Phase One –process tries to lock all records it needs, one at a time –if needed record found locked, start over –(no real work done in phase one) If phase one succeeds, it starts second phase, –performing updates –releasing locks Note similarity to requesting all resources at once Algorithm works where programmer can arrange – program can be stopped, restarted

29. 28 Nonresource Deadlocks Possible for two processes to deadlock –each is waiting for the other to do some task Can happen with semaphores –each process required to do a down() on two semaphores (mutex and another) –if done in wrong order, deadlock results

30. 29 Starvation Algorithm to allocate a resource –may be to give to shortest job first Works great for multiple short jobs in a system May cause long job to be postponed indefinitely –even though not blocked Solution: –First-come, first-serve policy