Distributed algorithm for communication deadlock detection
Information and Software Technology
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
A Distributed Deadlock Resolution Algorithm for the AND Model
IEEE Transactions on Parallel and Distributed Systems
Some Deadlock Properties of Computer Systems
ACM Computing Surveys (CSUR)
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
Efficient Distributed Deadlock Detection and Resolution using Probes, Tokens, and Barriers
ICPADS '97 Proceedings of the 1997 International Conference on Parallel and Distributed Systems
A Fast Algorithm for Detecting Distributed Deadlocks in the OR Request Model
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
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)
A Distributed Algorithm for Knot Detection in a Distributed Graph
ICPP '02 Proceedings of the 2002 International Conference on Parallel Processing
A Safe Algorithm for Resolving OR Deadlocks
IEEE Transactions on Software Engineering
On Optimal Deadlock Detection Scheduling
IEEE Transactions on Computers
Efficient detection of a locally stable predicate in a distributed system
Journal of Parallel and Distributed Computing
A concurrent distributed deadlock detection/resolution algorithm for distributed systems
ISTASC'05 Proceedings of the 5th WSEAS/IASME International Conference on Systems Theory and Scientific Computation
A graph based approach for MPI deadlock detection
Proceedings of the 23rd international conference on Supercomputing
Static Analysis of Concurrent Programs Using Ordinary Differential Equations
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
Distributed and Parallel Databases
MPI runtime error detection with MUST: advances in deadlock detection
SC '12 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
MPI runtime error detection with MUST: Advances in deadlock detection
Scientific Programming - Selected Papers from Super Computing 2012
Hi-index | 0.01 |
In the literature, only a few studies have been performed on the distributed deadlock detection and resolution problem in the generalized request model. Most of the studies are based on the diffusing computation technique where propagation of probes and backward propagation of replies are required to detect deadlock. The replies carry the dependency information between processes for the initiator of the algorithm to determine deadlock. Since fast detection of deadlock is critical, we take a centralized approach that removes the need of backward propagation of replies, but sends the dependency information directly to the initiator of the algorithm. This enables reduction of time cost for deadlock detection to half of that of the existing distributed algorithms. The algorithm is extended to handle concurrent executions in order to further improve deadlock detection time, whereas the current algorithms focus only on a single execution. Simulation experiments are performed to see the effectiveness of this centralized approach as compared to previous distributed algorithms. It is found that our algorithm shows better results in several performance metrics especially in deadlock latency and algorithm execution time.