The distributed deadlock detection algorithm
ACM Transactions on Computer Systems (TOCS)
A distributed scheme for detecting communication deadlocks
IEEE Transactions on Software Engineering
Local Distributed Deadlock Detection by Cycle Detection and Clusterng
IEEE Transactions on Software Engineering - Special issue on distributed systems
Cooperative Distributed Algorithms for Dynamic Cycle Prevention
IEEE Transactions on Software Engineering
A fully distributed termination detection scheme
Information Processing Letters
Distributed deadlock detection algorithm
ACM Transactions on Database Systems (TODS)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Termination Detection of Diffusing Computations in Communicating Sequential Processes
ACM Transactions on Programming Languages and Systems (TOPLAS)
A Distributed Graph Algorithm: Knot Detection
ACM Transactions on Programming Languages and Systems (TOPLAS)
Distributed deadlock detection
ACM Transactions on Computer Systems (TOCS)
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Communicating sequential processes
Communications of the ACM
A distributed algorithm for detecting resource deadlocks in distributed systems
PODC '82 Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Distributed deadlock detection in Ada run-time environments
TRI-Ada '90 Proceedings of the conference on TRI-ADA '90
Termination Detection Protocols for Mobile Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
An Efficient Distributed Deadlock Avoidance Algorithm for the AND Model
IEEE Transactions on Software Engineering
A Fast Algorithm for Detecting Distributed Deadlocks in the OR Request Model
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
On deadlocks of exclusive AND-requests for resources
Distributed Computing
Static Analysis of Concurrent Programs Using Ordinary Differential Equations
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
| Hi-index | 0.00 |
An algorithm for detecting deadlocks in distributed systems with CSP-like communication is proposed. Unlike previous work, the proposed algorithm avoids periodically sending deadlock-detecting messages by the processes and requires no local storage for the processes with size predetermined by the number of processes in the system. The algorithm is proven to have the following properties: (0) it never detects false deadlocks; (1) it has only one process in a knot report the deadlock; and (2) it detects every true deadlock in finite time.