Deadlock detection in distributed databases
ACM Computing Surveys (CSUR)
Resolution of Deadlocks in Object-Oriented Distributed Systems
IEEE Transactions on Computers
Characterization and correctness of distributed deadlock detection and resolution
Characterization and correctness of distributed deadlock detection and resolution
Distributed snapshots: determining global states of distributed systems
ACM Transactions on Computer Systems (TOCS)
Deadlock models and a general algorithm for distributed deadlock detection
Journal of Parallel and Distributed Computing
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)
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
A One-Phase Algorithm to Detect Distributed Deadlocks in Replicated Databases
IEEE Transactions on Knowledge and Data Engineering
Performance Analysis of Distributed Deadlock Detection Algorithms
IEEE Transactions on Knowledge and Data Engineering
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)
Fast, Centralized Detection and Resolution of Distributed Deadlocks in the Generalized Model
IEEE Transactions on Software Engineering
| Hi-index | 0.00 |
We propose a new distributed algorithm for detecting generalized deadlocks in distributed systems. It records the consistent snapshot of distributed Wait-For Graph (WFG) through propagating the probe messages along the edges of WFG. It then reduces the snapshot by eliminating the unblocked processes to determine the set of deadlocked processes. However, the reducibility of each blocked process is arbitrarily delayed until a node collects the replies in response to all probes, unlike the earlier algorithms. We also prove the correctness of the proposed algorithm. It has a worst-case time complexity of 2d time units and the message complexity of 2e, where d is the diameter and e is the number of edges of the WFG. The significant improvement of proposed algorithm over other algorithms is that it reduces the data traffic complexity into constant by using fixed sized messages. Furthermore, it minimizes additional messages to resolve deadlocks.