Browse > Article

A Distributed Deadlock Detection and Resolution Algorithm for the OR Model  

Lee, Soo-Jung (Dept.of Computer Education, Gyeongin National University of Education)
Abstract
Deadlock detection in distributed systems is considered difficult since no single site knows the exact information on the whole system state. This paper proposes a time-efficient algorithm for distributed deadlock detection and resolution. The initiator of the algorithm propagates a deadlock detection message and builds a reduced wait-for graph from the information carried by the replies. The time required for deadlock detection is reduced to half of that of the other algorithms. Moreover, any deadlock reachable from the initiator is detected whereas most previous algorithms only find out whether the initiator is involved in deadlock. This feature accelerates the detection of deadlock. Resolution of the detected deadlock is also simplified and precisely specified, while the current algorithms either present no resolution scheme or simply abort the initiator of the algorithm upon detecting deadlock.
Keywords
distributed systems; distributed algorithms; deadlock detection; knot detection; deadlock resolution;
Citations & Related Records
연도 인용수 순위
  • Reference
1 N. Natarajan, 'A distributed scheme for detecting communication deadlocks,' IEEE Transactions on Software Engineering, Vol. 12, pp. 531-537, 1986   DOI
2 E. W. Dijkstra and C. S. Scholten, 'Termination detection for diffusing computations,' Information Processing Letters, Vol. 11, No.1, pp. 1-4, 1980   DOI   ScienceOn
3 P. A. Bernstein and V. Hadzilacos and N. Goodman, Concurrency Control and Recovery in Database Systems, Addison-Wesley, 1987
4 A. Boukerche and C. Tropper, 'A distributed graph algorithm for the detection of local cycles and knots,' IEEE Trans. Parallel and Distributed Systems, Vol. 9, No.8, pp. 748-757, 1998   DOI   ScienceOn
5 R. C. Holt, 'Some deadlock properties of computer systems,' ACM Computing Surveys, Vol. 4, pp. 179-196, 1972   DOI   ScienceOn
6 J. Villadangos and F. Farina and J. R. Mendivil, 'A safe distributed deadlock resolution algorithm for the OR request model, The 6th Euromicro Workshop on Parallel and Distributed Processing, pp. 150-156, 1998   DOI
7 K. M. Chandy and J. Misra and L. M. Haas, 'Distributed deadlock detection,' ACM Transactions on Computer Systems, Vol. 1, pp. 144-156, 1983   DOI
8 S. Lee, 'Fast detection and resolution of generalized distributed deadlocks,' 10th Euromicro Workshop on Parallel, Distributed and Network-based Processing, pp. 429-436, 2002
9 I. Cidon, 'An efficient distributed knot detection algorithm,' IEEE Transactions on Software Engineering, Vol. 15, pp. 644-649, 1989   DOI   ScienceOn
10 J. Wang and S. Huang and N. Chen, 'A distributed algorithm for detecting generalized deadlocks,' Tech. Rep., Dept. of Computer Science, National Tsing-Hua Univ., 1990
11 M. Singhal, 'Deadlock detection in distributed systems,' IEEE Computer, Vol. 22, pp. 37-48, 1989   DOI   ScienceOn
12 G. Bracha and S. Toueg, 'A distributed algorithm for generalized deadlock detection,' Distributed Computing, Vol. 2, pp. 127-138, 1987   DOI
13 S. Lee and J. L. Kim, 'Performance Analysis of Distributed Deadlock Detection Algorithms, ' IEEE Transactions on Knowledge and Data Engineering, Vol. 13, No.4, pp.623-636, 2001   DOI   ScienceOn
14 A. D. Kshemkalyani and M. Singhal, 'A one-phase algorithm to detect distributed deadlocks In replicated databases, ' IEEE Transactions on Knowledge and Data Engineering, Vol. 11, No.6, pp. 880-895, 1999   DOI   ScienceOn
15 A. D. Kshemkalyani and M. Singhal, 'Distributed detection of generalized deadlocks,' 17th Ini'l Cant Distributed Computing Systems, pp. 553-560, 1997
16 A. V. Aho and J. E. Hopcroft and J. D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974