Fast, Centralized Detection and Resolution of Distributed Deadlocks in the Generalized Model
IEEE Transactions on Software Engineering
Stochastic analysis of distributed deadlock scheduling
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Static Analysis of Concurrent Programs Using Ordinary Differential Equations
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
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
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 |
PROBES and TOKENS are used in many deadlock detection and resolution algorithms. A deadlock is detected by propagating PROBES along dependency edges. When the initiator p_i of a probe receives its probe back, it knows of the existence of a deadlock. p_i then sends out a TOKEN to clean up those probes in the deadlock cycle which, if not removed, may later lead to phantom deadlock detections. Only after the token returns to p_i is the deadlock resolved by aborting a `victim' (usually p_i). As a result, all involved transactions remain waiting and all involved resources locked until the token returns to p_i, although the deadlock was already detected when the probe returned to p_i. This paper proposes the idea of BARRIERS to allow the deadlock to be resolved without waiting for the token to return to p_i, thereby reducing the average deadlock persistence time considerably.