Deadlock detection in distributed databases
ACM Computing Surveys (CSUR)
A Modified Priority Based Probe Algorithm for Distributed Deadlock Detection and Resolution
IEEE Transactions on Software Engineering
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)
Some Deadlock Properties of Computer Systems
ACM Computing Surveys (CSUR)
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
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
Characterization of Deadlocks in k-ary n-Cube Networks
IEEE Transactions on Parallel and Distributed Systems
A Formal Model of Message Blocking and Deadlock Resolution in Interconnection Networks
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
Finding Consistent Global Checkpoints in a Distributed Computation
IEEE Transactions 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
The VLDB Journal — The International Journal on Very Large Data Bases
A Distributed Algorithm for Deadlock Detection under OR-Request Model
SRDS '99 Proceedings of the 18th IEEE Symposium on Reliable Distributed Systems
Efficient Generalized Deadlock Detection and Resolution in Distributed Systems
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Fast, Centralized Detection and Resolution of Distributed Deadlocks in the Generalized Model
IEEE Transactions on Software Engineering
On Optimal Deadlock Detection Scheduling
IEEE Transactions on Computers
Efficient detection and resolution of OR deadlocks in distributed systems
Journal of Parallel and Distributed Computing
Efficient detection of a locally stable predicate in a distributed system
Journal of Parallel and Distributed Computing
Detection and resolution of atomicity violation in service composition
Proceedings of the the 6th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering
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
Fast detection and resolution of generalized distributed deadlocks
EUROMICRO-PDP'02 Proceedings of the 10th Euromicro conference on Parallel, distributed and network-based processing
Distributed and Parallel Databases
On time complexity of distributed algorithms for generalized deadlock detection
ADBIS'97 Proceedings of the First East-European conference on Advances in Databases and Information systems
| Hi-index | 0.01 |
We present an efficient one-phase algorithm that consists of two concurrent sweeps of messages to detect generalized distributed deadlocks. In the outward sweep, the algorithm records a snapshot of a distributed wait-for-graph (WFG). In the inward sweep, the algorithm performs reduction of the recorded distributed WFG to check for a deadlock. The two sweeps can overlap in time at a process. We prove the correctness of the algorithm. The algorithm has a worst-case message complexity of 4e/spl minus/2n+2l and a time complexity of 2d hops, where e is the number of edges, n is the number of nodes, l is the number of leaf nodes, and d is the diameter of the WFG. This is a notable improvement over the existing algorithms to detect generalized deadlocks.