Distributed deadlock detection
K. Mani Chandy, Jayadev Misra, Laura M. Haas · ACM Transactions on Computer Systems · 1983
Distributed deadlock models are presented for resource and communication deadlocks.Simple distributed algorithms for detection of these deadlocks are given.We show that all true deadlocks are detected and that no false deadlocks are reported.In our algorithms, no process maintains global information; all messages have an identical short length.The algorithms can be applied in distributed database and other message communication systems.
Cited by 392 works. doi:10.1145/357360.357365 Open-access PDF
Authors
References
- Time, clocks, and the ordering of events in a distributed system
- Communicating Sequential Processes
- Communicating sequential processes
- Notes on data base operating systems
- Communicating sequential processes
- Time, clocks, and the ordering of events in a distributed system
- Termination detection for diffusing computations
- Locking and Deadlock Detection in Distributed Data Bases
- On Deadlock Detection in Distributed Systems
- Distributed deadlock detection algorithm