A distributed scheme for detecting communication deadlocks
IEEE Transactions on Software Engineering
Local distributed deadlock detection by knot detection
SIGCOMM '86 Proceedings of the ACM SIGCOMM conference on Communications architectures & protocols
Deadlock detection in distributed databases
ACM Computing Surveys (CSUR)
Self-stabilizing deadlock detection algorithms
CSC '92 Proceedings of the 1992 ACM annual conference on Communications
ACM Computing Surveys (CSUR)
Some Deadlock Properties of Computer Systems
ACM Computing Surveys (CSUR)
Distributed deadlock detection
ACM Transactions on Computer Systems (TOCS)
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Deadlock-Free Oblivious Wormhole Routing with Cyclic Dependencies
IEEE Transactions on Computers
A distributed algorithm for generalized deadlock detection
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
A Distributed Algorithm for Deadlock Detection under OR-Request Model
SRDS '99 Proceedings of the 18th IEEE Symposium on Reliable Distributed Systems
| Hi-index | 0.00 |
This article introduces a self-stabilizing deadlock-detection algorithm for the OR model. The algorithm is complete, because it detects all deadlocks, and it is correct, because it does not detect false deadlocks. Because of the self-stabilization property, the algorithm supports dynamic changes in the wait-for graph on which it works, and transient faults; also, it can be started in an arbitrary state. Previous deadlock-detection algorithms for the OR model are not guaranteed to recover from transient faults, nor can they be started in an arbitrary state. Once the algorithm terminates, each process knows if it is or not deadlocked; moreover, deadlocked processes know whether they cause or only suffer from deadlock.