Table of contentsChapter 7: Deadlocks Slide 2 Chapter Objectives The Deadlock Problem Bridge Crossing Example System Model Deadlock Characterization Resource-Allocation Graph Resource-Allocation Graph (Cont.) Example of a Resource Allocation Graph Resource Allocation Graph With A Deadlock Graph With A Cycle But No Deadlock Basic Facts Methods for Handling Deadlocks Deadlock Prevention Deadlock Prevention (Cont.) Deadlock Avoidance Safe State Slide 19 Safe, Unsafe , Deadlock State Avoidance algorithms Resource-Allocation Graph Scheme Slide 23 Unsafe State In Resource-Allocation Graph Resource-Allocation Graph Algorithm Banker’s Algorithm Data Structures for the Banker’s Algorithm Safety Algorithm Resource-Request Algorithm for Process Pi Example of Banker’s Algorithm Example (Cont.) Example: P1 Request (1,0,2) Deadlock Detection Single Instance of Each Resource Type Resource-Allocation Graph and Wait-for Graph Several Instances of a Resource Type Detection Algorithm Detection Algorithm (Cont.) Example of Detection Algorithm Slide 40 Detection-Algorithm Usage Recovery from Deadlock: Process Termination Recovery from Deadlock: Resource Preemption End of Chapter 7 |
Author: Silberschatz, galvin, and Gagne Homepage: http://www.cs.yale.edu/homes/avi/os-book/os7/index.html Further information: |