Detection and resolution of deadlocks in distributed database systems
CIKM '95 Proceedings of the fourth international conference on Information and knowledge management
A Distributed Deadlock Resolution Algorithm for the AND Model
IEEE Transactions on Parallel and Distributed Systems
An Efficient Distributed Deadlock Avoidance Algorithm for the AND Model
IEEE Transactions on Software Engineering
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
A Fault-Tolerant Distributed Deadlock Detection Algorithm
IWDC '02 Proceedings of the 4th International Workshop on Distributed Computing, Mobile and Wireless Computing
The VLDB Journal — The International Journal on Very Large Data Bases
A Safe Algorithm for Resolving OR Deadlocks
IEEE Transactions on Software Engineering
M-Guard: a new distributed deadlock detection algorithm based on mobile agent technology
ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications
Efficient detection and resolution of deadlocks in distributed databases
Computer Communications
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 |
It is argued that most previous proposals for distributed deadlock detection are incorrect because they have used informal/intuitive arguments to prove the correctness of their algorithms. Informal and intuitive arguments are prone to errors because of the highly complex nature of distributed deadlock detection/resolution algorithms. The priority-based probe algorithm for distributed deadlock detection and resolution of A.L. Choudhary et al. (1989) is corrected, and it is formally proven that the modified algorithm is correct (i.e., that it does detect all deadlocks and does not report phantom deadlocks). The proof technique is novel in that the authors first abstract the properties of the deadlock detection and resolution algorithm by invariants, and then show that the invariants imply the desired correctness of the algorithm