
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
A.D. Kshemkalyani, M. Singhal, "Efficient Detection and Resolution of Generalized Distributed Deadlocks," IEEE Transactions on Software Engineering, vol. 20, no. 1, pp. 4354, January, 1994.  
BibTex  x  
@article{ 10.1109/32.263754, author = {A.D. Kshemkalyani and M. Singhal}, title = {Efficient Detection and Resolution of Generalized Distributed Deadlocks}, journal ={IEEE Transactions on Software Engineering}, volume = {20}, number = {1}, issn = {00985589}, year = {1994}, pages = {4354}, doi = {http://doi.ieeecomputersociety.org/10.1109/32.263754}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Software Engineering TI  Efficient Detection and Resolution of Generalized Distributed Deadlocks IS  1 SN  00985589 SP43 EP54 EPD  4354 A1  A.D. Kshemkalyani, A1  M. Singhal, PY  1994 KW  concurrency control; computational complexity; directed graphs; operating systems (computers); generalized distributed deadlock resolution; onephase algorithm; concurrent sweeps; messages; generalized distributed deadlock detection; outward sweep; distributed waitforgraph; inward sweep; distributed snapshot; algorithm correctness; worstcase message complexity; time complexity; leaf nodes; graph reduction; distributed system; directed graph VL  20 JA  IEEE Transactions on Software Engineering ER   
We present an efficient onephase 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 waitforgraph (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 worstcase 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. 127138, 1987.
[2] A. L. Choudharyet al., "A modified prioritybased probe algorithm for distributed deadlock detection and resolution,"IEEE Trans. Software Eng., vol. 16, pp. 1017, 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. 6375, Feb. 1985.
[4] T. Herman and K. M. Chandy, "A distributed procedure to detect AND/OR deadlocks," Dept. Comput. Sci. Tech. Rep. TRLCS8301, 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. 179196, Sept. 1972.
[6] S. Huang, "Detecting termination of distributed computations by external agents,"Proc. 9th Int. Conf. Distributed Comput. Syst., pp. 7984, 1989.
[7] E. Knapp, "Deadlock detection in distributed databases,"ACM Comput. Surveys, vol. 19, no. 4, pp. 303328, 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. 558565, July 1978.
[10] M. Roesler and W. A. Burkhard, "Resolution of deadlocks in objectoriented distributed systems,"IEEE Trans. Comput., vol. 38, pp. 12121224, 1989.
[11] M. Singhal, "Deadlock detection in distributed systems,"Comput., pp. 3748, Nov. 1989.
[12] M. K. Sinha and N. Natarajan, "A prioritybased distributed deadlock detection algorithm,"IEEE Trans. Software Eng., vol. 12, pp. 6780, Jan. 1985.
[13] J. Wang, S. Huang, and N. Chen, "A distributed algorithm for detecting generalized deadlocks," Tech. Rep., Dept. of Comput. Sci., National TsingHua University, 1990.