Deadlock detection in distributed databases
ACM Computing Surveys (CSUR)
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
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
The VLDB Journal — The International Journal on Very Large Data Bases
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
A distributed algorithm for deadlock detection and resolution
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Distributed detection of generalized deadlocks
ICDCS '97 Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97)
A Distributed Algorithm for Knot Detection in a Distributed Graph
ICPP '02 Proceedings of the 2002 International Conference on Parallel Processing
DS-RT '02 Proceedings of the Sixth IEEE International Workshop on Distributed Simulation and Real-Time Applications
Fast, Centralized Detection and Resolution of Distributed Deadlocks in the Generalized Model
IEEE Transactions on Software Engineering
An efficient distributed algorithm for detection of knots and cycles in a distributed graph
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.00 |
Numerous deadlock detection algorithms were proposed for distributed systems, but most of them assumed the static wait-for graph (WFG), which is inconsistent with the dynamic application environment of distributed systems, in fact they can not run concurrently. A novel instance of diffusion-computation algorithms is proposed in this paper to resolve the concurrency problem. In our algorithm, a Dynamic WFG (DWFG) is raised, where the blocked transactions creating or quitting is responded to the nodes joining or disappearing in DWFG. Three additional detection termination conditions are assigned for the concurrent running of the proposed algorithm: the being detected node is a leaf or quitted, or fault occurs in the system. By these methods the concurrent running detections can terminate eventually and the deadlock can be resolved correctly. The correctness of the proposed algorithm is proven. Performance evaluation shows the time and message complexity of our algorithm outperforms the existing algorithms under a static WFG.