PPT-Deadlock: Part II

Reading Assignment T M Pinkston Deadlock Characterization and Resolution in Interconnection Networks Chapter 13 in Deadlock Resolution in Computer Integrated Systems CRC Press 2004. Concurrency: Deadlock and Starvation. Operating Systems:. Internals and Design Principles, 6/E. William Stallings. Patricia Roy. Manatee Community College, Venice, FL. ©2008, Prentice Hall. Dining Philosophers Problem. Mark Stanovich. Operating Systems. COP 4610. Deadlocks. Resource:. Something a thread waits for. Deadlocks. : Occur when threads are waiting for resources with circular dependencies. Often involve . Concurrency: Deadlock and Starvation. Operating Systems:. Internals and Design Principles, 6/E. William Stallings. Patricia Roy. Manatee Community College, Venice, FL. ©2008, Prentice Hall. Deadlock. Concurrency: Deadlock and Starvation. Operating Systems:. Internals and Design Principles. Seventh Edition. By William Stallings. Operating Systems:. Internals and Design Principles. When two trains approach each other at a crossing, both shall come to a full stop and neither shall start up again until the other has gone. Statute passed by the Kansas State Legislature, early in the 20th century.. DEADLOCKS. Manju Muralidharan . Priya. Objective. At the end of this presentation, you will know:. What is a Deadlock?. Preventing and Avoiding Deadlocks. Detecting Deadlocks. Recovery Schemes. 2. CS 561 Deadlocks. Chapter 6. 2. Outline. Principles of Deadlock. Introduction and conditions for deadlock. Deadlock prevention. Deadlock Avoidance. Deadlock detection. An Integrated deadlock strategy. Concurrency Mechanisms in UNIX, Linux, Solaris and Windows. cs550. Operating Systems. David . Monismith. Deadlock. Four requirements for deadlock . Hold and wait - process holds resource while waiting for more resources . Mutual Exclusion - resource can't be shared. 1. 7.1 System Model. A system consists of a set of resources. The resources can be grouped into types. Processes compete to have (unique) access to instances of the types. 2. Examples of resource types:. Reading Assignment. T. M. Pinkston, . “. Deadlock Characterization and Resolution in Interconnection Networks,. ”. Chapter 13 in . Deadlock Resolution in Computer Integrated Systems. , CRC Press 2004. CSSE 332. Operating Systems. Rose-Hulman Institute of Technology. Approaches to deadlock handling. Deadlock Detection. Periodically run algorithm to detect circular waiting. After detecting deadlock,. IEEE TC. , May 1987. F. . Silla. , and J. . Duato. , “Improving the Efficiency of Adaptive Routing in Networks with Irregular Topology,” . HIPC. 1997. J. . Duato. “A New Theory of Deadlock-Free Adaptive Routing in Wormhole Networks,” . Deadlock . detection. Resource Allocation Graphs. Resource Pool and . C. ounting Semaphores. Dining . Philosophers Problem. Condition Variables . Resource Tables. Deadlock Definition. A . deadlock.  is a situation in which two or more competing actions are each waiting for the other to finish, and thus neither ever does. BYU CS 345. Concurrency. 2. CS 345. Stalling’s Chapter. #. Project. 1: Computer System Overview. 2: Operating System Overview. 4. P1:. Shell. 3: Process Description and Control. 4: Threads. 4. P2: Tasking. “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.”. Detection. “Is this system deadlocked, and if so, which processes are involved?”.