Lecture 13Chapter 7 Deadlocks.ppt

* * * * * Principles of Computer Operating Systems Modified from Silberschatz, Galvin and Gagne Lecture 13Chapter 7: Deadlocks Chapter 7: Deadlocks The Deadlock Problem System Model Deadlock Characterization Methods for Handling Deadlocks Deadlock Prevention Deadlock Avoidance Deadlock Detection Recovery from Deadlock Chapter Objectives 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 The Deadlock Problem 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 P1 and P2 each hold one disk drive and each needs another one Example semaphores A and B, initialized to 1 P0 P1 wait (A); wait(B) wait (B); wait(A) 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 Note : Most OSes do not prevent or deal with deadlocks Illustration of a deadlock A deadlock is a permanent blocking of a set of threads a deadlock can happen while threads/processes are competing for system resources or communicating with each other Tanenbaum, A. S. (2001) Modern Operating Systems (2nd Edition). Deadlock Principles Happy scheduling 1 Illustration of a deadlock — scheduling path 1 ? Q executes everything before P can ever get A when P is ready, resources A and B are free and P can proceed Process Q ... Get B ... Get A ... Release B ... Release A ... A required B required B required A required Process P ... Get A ... Get B ... Release A ... Release B ... Deadlock Principles Happy scheduling 2 Illustration of a deadlock — scheduling path 2 ? Q gets B and A, then P is scheduled; P wants A but is b