The Community for Technology Leaders
Green Image
<p>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.</p>
concurrency control; computational complexity; directed graphs; operating systems (computers); generalized distributed deadlock resolution; one-phase algorithm; concurrent sweeps; messages; generalized distributed deadlock detection; outward sweep; distributed wait-for-graph; inward sweep; distributed snapshot; algorithm correctness; worst-case message complexity; time complexity; leaf nodes; graph reduction; distributed system; directed graph

M. Singhal and A. Kshemkalyani, "Efficient Detection and Resolution of Generalized Distributed Deadlocks," in IEEE Transactions on Software Engineering, vol. 20, no. , pp. 43-54, 1994.
89 ms
(Ver 3.3 (11022016))