System Deadlocks¶
Coffman, E. G., Elphick, M., & Shoshani, A. (1971). System Deadlocks. ACM Computing Surveys, 3(2), 67-78.
Cited by¶
5 citations across 5 artifacts.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Deadlock
- Goal Shielding
- Concurrency theory's deadlock, starvation, and priority inversion port to individual attention management as diagnostic concepts: deadlock is two goals each waiting on the other's release, starvation is a chronically deprioritised goal that never gets shielded time.
This sourceDefines deadlock (the four Coffman conditions) and starvation in concurrent resource allocation, the diagnostic concepts ported to attention management (deadlock as mutual waiting, starvation as a chronically deprioritized goal).
- Concurrency theory's deadlock, starvation, and priority inversion port to individual attention management as diagnostic concepts: deadlock is two goals each waiting on the other's release, starvation is a chronically deprioritised goal that never gets shielded time.
- Mutual Exclusion
- The interventions are strikingly portable, and they transfer as a menu keyed to the structure. Shrink the critical region: take the lock later and release it earlier, narrow the exclusivity claim, reduce the airlock dwell, shorten the legal exclusivity window — the same move wherever serialization is paid. Add timeouts to bound the hold: recover liveness when a holder fails, via lease-based locks, expiry clauses in contracts, or dead-man switches in railway interlocks. Order resource acquisition: a single fixed-order rule prevents operating-system deadlock, dining-philosophers deadlock, and bargaining stalemate alike.
This sourceStates the four necessary conditions for deadlock and resource-ordering as a deadlock-prevention strategy.
- The interventions are strikingly portable, and they transfer as a menu keyed to the structure. Shrink the critical region: take the lock later and release it earlier, narrow the exclusivity claim, reduce the airlock dwell, shorten the legal exclusivity window — the same move wherever serialization is paid. Add timeouts to bound the hold: recover liveness when a holder fails, via lease-based locks, expiry clauses in contracts, or dead-man switches in railway interlocks. Order resource acquisition: a single fixed-order rule prevents operating-system deadlock, dining-philosophers deadlock, and bargaining stalemate alike.
Mechanisms¶
- Blocked Dependency Trace
- … is to record the specific held condition at each hop (so a revisit is a true circular wait, not just a busy department) and to hand the loop to a mechanism that carries the authority to act, such as Mediation or Renegotiation or Escalation to Authority.
This sourceDefines circular wait as a closed chain in which each process holds a resource requested by the next.
- … is to record the specific held condition at each hop (so a revisit is a true circular wait, not just a busy department) and to hand the loop to a mechanism that carries the authority to act, such as Mediation or Renegotiation or Escalation to Authority.
- Process Kill or Restart
- This is the same victim-choice dial deadlock recovery always faces
This sourceFrames deadlock recovery as choosing which deadlocked tasks or resources to abort or preempt, with the choice governed by recovery cost.
- This is the same victim-choice dial deadlock recovery always faces
Verification¶
This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.
Registry ID ref:725612a94162 · see in the full table