A distributed scheme for detecting communication deadlocks
IEEE Transactions on Software Engineering
Distributed algorithm for communication deadlock detection
Information and Software Technology
Characterization and correctness of distributed deadlock detection and resolution
Characterization and correctness of distributed deadlock detection and resolution
A Distributed Graph Algorithm for the Detection of Local Cycles and Knots
IEEE Transactions on Parallel and Distributed Systems
Distributed deadlock detection
ACM Transactions on Computer Systems (TOCS)
Graph Algorithms
Efficient Detection and Resolution of Generalized Distributed Deadlocks
IEEE Transactions on Software Engineering
Optimal deadlock detection in distributed systems based on locally constructed wait-for graphs
ICDCS '96 Proceedings of the 16th International Conference on Distributed Computing Systems (ICDCS '96)
Distributed detection of generalized deadlocks
ICDCS '97 Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97)
Performance study of distributed deadlock detection algorithms for distributed database systems
Performance study of distributed deadlock detection algorithms for distributed database systems
MC2DR: multi-cycle deadlock detection and recovery algorithm for distributed systems
HPCC'07 Proceedings of the Third international conference on High Performance Computing and Communications
Hi-index | 0.00 |
This paper presents an algorithm for detecting generalized deadlocks in distributed systems. Most of the existing algorithms use diffusing computation technique for deadlock detection in which deadlock detection messages called probes are propagated through the wait-for graph and replies are sent backwards to the initiator of the algorithm carrying the information on wait-for relations between nodes. Based on the collected information, the initiator determines a deadlock. In order to expedite the deadlock detection activity, the proposed algorithm exploits the probes rather than the replies to carry the information required for deadlock detection. As the probes are propagated, the unblocking function of each node is merged and carried onto the message. As a result, time and communication costs are reduced up to half of those of the existing algorithms. Furthermore, deadlock resolution is simplified in our scheme with no additional message rounds as in other algorithms.