This Article 
 Bibliographic References 
 Add to: 
Efficient Detection and Resolution of Generalized Distributed Deadlocks
January 1994 (vol. 20 no. 1)
pp. 43-54

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.

[1] G. Bracha and S. Toeug, "Distributed deadlock detection,"Distributed Comput., vol. 2, pp. 127-138, 1987.
[2] A. L. Choudharyet al., "A modified priority-based probe algorithm for distributed deadlock detection and resolution,"IEEE Trans. Software Eng., vol. 16, pp. 10-17, Jan. 1989.
[3] K. M. Chandy and L. Lamport, "Distributed snapshots: Determining global states of distributed systems,"ACM Trans. Comput. Syst., vol. 3, no. 1, pp. 63-75, Feb. 1985.
[4] T. Herman and K. M. Chandy, "A distributed procedure to detect AND/OR deadlocks," Dept. Comput. Sci. Tech. Rep. TR-LCS-8301, University of Texas, Austin, TX, Feb. 1983.
[5] R. C. Holt, "Some deadlock properties of computer systems,"ACM Comput. Surveys, vol. 4, no. 3, pp. 179-196, Sept. 1972.
[6] S. Huang, "Detecting termination of distributed computations by external agents,"Proc. 9th Int. Conf. Distributed Comput. Syst., pp. 79-84, 1989.
[7] E. Knapp, "Deadlock detection in distributed databases,"ACM Comput. Surveys, vol. 19, no. 4, pp. 303-328, Dec. 1987.
[8] A. D. Kshemkalyani, "Characterization and correctness of distributed deadlock detection and resolution," Ph.D. dissertation, Ohio State University, Aug. 1991.
[9] L. Lamport, "Time, clocks, and the ordering of events in a distributed system,"Commun. ACM, vol. 21, no. 7, pp. 558-565, July 1978.
[10] M. Roesler and W. A. Burkhard, "Resolution of deadlocks in object-oriented distributed systems,"IEEE Trans. Comput., vol. 38, pp. 1212-1224, 1989.
[11] M. Singhal, "Deadlock detection in distributed systems,"Comput., pp. 37-48, Nov. 1989.
[12] M. K. Sinha and N. Natarajan, "A priority-based distributed deadlock detection algorithm,"IEEE Trans. Software Eng., vol. 12, pp. 67-80, Jan. 1985.
[13] J. Wang, S. Huang, and N. Chen, "A distributed algorithm for detecting generalized deadlocks," Tech. Rep., Dept. of Comput. Sci., National Tsing-Hua University, 1990.

Index Terms:
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
A.D. Kshemkalyani, M. Singhal, "Efficient Detection and Resolution of Generalized Distributed Deadlocks," IEEE Transactions on Software Engineering, vol. 20, no. 1, pp. 43-54, Jan. 1994, doi:10.1109/32.263754
Usage of this product signifies your acceptance of the Terms of Use.