This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Performance Analysis of Distributed Deadlock Detection Algorithms
July/August 2001 (vol. 13 no. 4)
pp. 623-636

Abstract—This paper presents a probabilistic performance analysis of a deadlock detection algorithm in distributed systems. Although there has been extensive study on deadlock detection algorithms in distributed systems, little attention has been paid to the study of the performance of these algorithms. Most work on performance study has been achieved through simulation but not through an analytic model. Min [14], to the best of our knowledge, made the sole attempt to evaluate the performance of distributed deadlock detection algorithms analytically. Being different from Min's [14], our analytic approach takes the time-dependent behavior of each process into consideration rather than simply taking the mean-value estimation. Furthermore, the relation among the times when deadlocked processes become blocked is studied, which enhances the accuracy of the analysis. We measure performance metrics such as duration of deadlock, the number of algorithm invocations, and the mean waiting time of a blocked process. It is shown that the analytic estimates are nearly consistent with simulation results.

[1] 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, Aug. 1998.
[2] O. Bukhres, “Performance Comparison of Distributed Deadlock Detection Algorithms,” Proc. Int'l Conf. Data Eng., 1992.
[3] K.M. Chandy, J. Misra, and L. Hass, "Distributed Deadlock," ACM Trans. Computer Systems, vol. 1, no. 2, pp. 144-156, May 1983.
[4] M.S. Chen, “Shortest Paths in Communication Networks,” Proc. IEEE Global Telecomm. Conf., pp. 1251-1257, Dec. 1986.
[5] S. Chen, Y. Deng, P.C. Attie, and W. Sun, Optimal Deadlock Detection in Distributed Systems Based on Locally Constructed Wait-For Graphs Proc. Int'l Conf. Distributed Computing Systems, pp. 613-619, May 1996.
[6] A.N. Choudhary, “Cost of Distributed Deadlock Detection: A Performance Study,” Proc. Sixth Int'l Conf. Data Eng., pp.174-181, Feb. 1990.
[7] A.L. Choudhary, W.H. Kohler, J.A. Stankovic, and D. Towsley, “A Modified Priority Based Probe Algorithm for Distributed Deadlock Detection and Resolution,” IEEE Trans. Software Eng., vol. 15, no. 1, pp. 10-17, Jan. 1989.
[8] B I. Galler and L. Bos, “A Model of Transaction Blocking in Databases,” Performance Evaluation, vol. 3, pp. 95-122, 1983.
[9] A.D. Kshemkalyani and M. Singhal, “Invariant-Based Verification of a Distributed Deadlock Detection Algorithm,” IEEE Trans. Software Eng., vol. 17, no. 8, pp. 789-799, Aug. 1991.
[10] S. Lee and J.L. Kim, “Resolving All Deadlocks in Distributed Systems,” Information Processing Letters, vol. 55, no. 5, pp. 265-271, 1995.
[11] S. Lee and J.L. Kim, “An Efficient Distributed Deadlock Detection Algorithm,” Proc. 15th IEEE Int'l Conf. Distributed Computing Systems, pp. 169-178, May 1995.
[12] K. Makki and N. Pissinou, “Detection and Resolution of Deadlocks in Distributed Database Systems,” Proc. Int'l Conf. Information and Knowledge Management, pp. 411-416, 1995.
[13] W.A. Massey, “A Probabilistic Analysis of a Database System,” Proc. Joint Conf. Computer Performance Modeling, Measurement, and Evaluation, and ACM SIGMETRICS, pp. 141-146, May 1986.
[14] K. Min, “Performance Study of Distributed Deadlock Detection Algorithms for Distributed Database Systems,” PhD thesis, Dept. of Computer Science, Univ. of Illinois at Urbana-Champaign, 1990.
[15] R. Obermark, "Distributed Deadlock Detection Algorithm," ACM Trans. Database Systems, vol. 7, no. 2, pp. 187-208, June 1982.
[16] Y.C. Park, P. Scheuermann, and H.-L. Tung, “A Distributed Deadlock Detection and Resolution Algorithm Based on A Hybrid Wait-for Graph and Probe Generation Scheme,” Proc. 10th Int'l Conf. Information and Knowledge Management, 1995.
[17] K.H. Pun and G.G. Belford, “Performance Study of Two Phase Locking in Single Site Database Systems,” IEEE Trans. Software Eng., vol. 13, no. 12, pp. 1311-1328, Dec. 1987.
[18] M. Roesler and W. A. Burkhard, “Resolution of Deadlocks in Object-Oriented Distributed Systems,” IEEE Trans. Computers, vol. 38, no. 8, pp. 1,212-1,224, Aug. 1989.
[19] S.C. Shyu, V.O.K. Li, and C.P. Weng, “Performance Analysis of Static Locking in Distributed Database Systems,” IEEE Trans. Computers, vol. 39, no. 6, pp. 741-751, June 1990.
[20] M. Singhal, “Deadlock Detection in Distributed Systems,” Computer, pp. 37-47, Nov. 1989.
[21] M.K. Sinha and N. Natarajan, “A Priority Based Distributed Deadlock Detection Algorithm,” IEEE Trans. Software Eng., vol. 11, pp. 67-80, Jan. 1985.
[22] K.S. Trivedi, Probability and Statistics with Reliability, Queuing, and Computer Science Applications. Prentice Hall, 1982.

Index Terms:
Deadlock detection, distributed algorithms, distributed systems, cycle detection, wait-for graph.
Citation:
Soojung Lee, Junguk L. Kim, "Performance Analysis of Distributed Deadlock Detection Algorithms," IEEE Transactions on Knowledge and Data Engineering, vol. 13, no. 4, pp. 623-636, July-Aug. 2001, doi:10.1109/69.940736
Usage of this product signifies your acceptance of the Terms of Use.