A distributed scheme for detecting communication deadlocks
IEEE Transactions on Software Engineering
An Efficient Distributed Knot Detection Algorithm
IEEE Transactions on Software Engineering
Distributed algorithm for communication deadlock detection
Information and Software Technology
A Distributed Graph Algorithm for the Detection of Local Cycles and Knots
IEEE Transactions on Parallel and Distributed Systems
Distributed deadlock detection
ACM Transactions on Computer Systems (TOCS)
A One-Phase Algorithm to Detect Distributed Deadlocks in Replicated Databases
IEEE Transactions on Knowledge and Data Engineering
Efficient Detection and Resolution of Generalized Distributed Deadlocks
IEEE Transactions on Software Engineering
Hi-index | 0.00 |
This paper proposes a distributed algorithm for resolving deadlocks under the OR request model. The algorithm builds a distributed spanning tree by propagating probes. An encoding scheme is devised to deduce the ancestor-descendant relationship between tree nodes, so that the initiator of the algorithm collects only non-tree edge information to detect deadlock, whereas the current algorithms require all the edge information for deadlock detection. The proposed algorithm resolves all deadlocks reachable from the initiator. Its performance in terms of number of messages and execution time is better than or comparable to that of the existing algorithms. We further showed through analytic evaluation that the suggested algorithm substantially shortens deadlock detection time.