Deadlock

1. Types of resources
   1. serially reusable resource
   2. consumable resource
2. Deadlock
3. Approaches to solving the problem
   1. avoidance
   2. prevention
   3. detection and recovery
4. System model
   1. states: process blocked, deadlocked; deadlock, safe states
   2. system: resource graph, with resource and process nodes, and request, assignment edges
   3. operations: request, acquire, release
5. Graph theory
   1. sinks, isolated nodes
   2. cycles, reach, knot
6. Deadlock detection with serially reusable resources
   1. Graph reduction
   2. Deadlock Theorem
   3. Cycle Theorem (general)
   4. Continuous deadlock detection: when do you have to look?
   5. Expedient states and the Knot Theorem
   6. Cycle Theorem (Single Unit Resources)
   7. Single unit requests in expedient states
7. Deadlock recovery
   1. lowest termination cost first
   2. minimum cost recovery
   3. process pre-emption
8. Deadlock prevention
   1. necessary and sufficient conditions
   2. collective request method
   3. pre-emption
   4. ordered request method
9. Deadlock avoidance
   1. maximum claim graphs
   2. Banker's algorithm
10. Consumable resources
    1. general properties
    2. known producers, unknown consumers: deadlock detection
    3. order of reductions
    4. theorems
    5. recovery
    6. known producers and known consumers
    7. claim-limited state
11. General Resource Graph
    1. Results

    ---

    
    Send email to cs251@csif.cs.ucdavis.edu.

    Department of Computer Science
    University of California at Davis
    Davis, CA 95616-8562

    
    

    ---

    Page last modified on 1/30/2000