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. Detection and Avoidance. Prof. Sirer. CS 4410. Cornell University. System Model. There are non-shared computer resources. Maybe more than one instance. Printers, Semaphores, Tape drives, CPU. Processes need access to these resources. What is it?. What is concurrency?. Concurrency is not a new idea…. Concurrency was first developed by the ancient Babylonians.. They thought about stuff, walked, and chewed gum … all at the same time.. 1. 6. Deadlocks. 6.1 Deadlocks with Reusable and Consumable. . Resources. 6.2 Approaches to the Deadlock Problem . 6.3 A System Model . Resource Graphs . State Transitions. Deadlock States and Safe States . 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. DEADLOCKS. To be discussed…. Definition of deadlock. Example of deadlock. Resource allocation graph. Strategies to handle deadlock. - . Deadlock Prevention. - . Deadlock Avoidance. - . 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. Dan C. Marinescu. Office: HEC 304. Office hours: M-. Wd. 11:30 - 12:30 . A. M. Last time: . CPU Scheduling. . Process synchronization. Today. Process . synchronization. Transactions. Locks. Deadlocks. 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. Ben Shelton. Motivation. Concurrent programming is . necessary. Multicore . revolution. Concurrent programming is . difficult, and . p. rogrammers need tools to help them write more reliable concurrent programs. 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,. 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?”.