Abstract
We propose a new distributed algorithm for detecting generalized deadlocks in distributed systems. The algorithm records the consistent distributed snapshot of global wait-for-graph (WFG) through propagating the probe messages in the forward phase and reducing the WFG to determine the entire set of deadlocked processes in the backward phase. The reducibility of each process is decided based on the information in replies that have received from its immediate wait-for processes during the reduction. We also formally prove the correctness of our algorithm. It has a worst case time complexity of 2d time units and the message complexity of 2e, where d is the diameter and e is the number of edges of the distributed spanning tree induced by the algorithm. The significant improvement of proposed algorithm over earlier algorithms is that it achieves optimum results using fixed sized messages and minimizes the messages to resolve deadlocks.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Knapp, E.: Deadlock Detection in Distributed Database System. ACM Computing Surveys 19(4), 303–327 (1987)
Singhal, M.: Deadlock detection in distributed systems. IEEE Computer 22, 37–48 (1989)
Dijkstra, E.W., Scholten, C.S.: Termination Detection for Diffusing Computations. InformationProcessing Letters 11(1), 104 (1980)
Bracha, G., Toueg, S.: A Distributed algorithm for Generalized Deadlock Detection. Distributed Computing 2, 127–138 (1987)
Wang, J., Huang, S., Chen, N.: A distributed algorithm for detecting generalized deadlocks, Tech.Rep., Dept. of Compter Science, National Tsing-Hua Univ. (1990)
Brzezinski, J., Helary, J.M., Raynal, M., Singhal, M.: Deadlock Models and a General Algorithm for Distributed Deadlock Detection. J. Parallel and Distributed Computing 31(2), 112–125 (1995)
Chandy, K.M., Misra, J., Hass, L.: Distributed Deadlock Detection. ACM Trans. On Computing Surveys 1(2) (May 1983)
Chandy, K.M., Lamport, L.: Distributed Snapshots: Determing global states of istributed systems. ACM Trans. Computer Systems 3(1), 63–75 (1985)
Chen, S., Deng, Y., Attie, P.: Deadlock detection and resolution in distributed systems based on locally constructed wait-for graphs, Tech. Report, School of Computer Science, Florida International University (August 1995)
Kshemkalyani, A.D.: Characterization and correctness of distributed deadlock detection and resolution, Ph.D dissertation, Ohio state Univ. (August 1991)
Kshemkalyani, A.D., Singhal, M.: Efficient detection and Resolution of generalized distributed deadlocks. IEEE Trans. Soft. Eng. 20(1), 43–54 (1994)
Kshemkalyani, A.D., Singhal, M.: A One-Phase Algorithm to detect distributed deadlocks in Replicated Databases. IEEE Trans. Knowledge and Data Eng. 11(6), 880–895 (1999)
Lee, S.: Fast, Centralized detection and resolution of distributed deadlocks in the Generalised model. IEEE Trans. Soft. Eng. 30(9), 561–573 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Srinivasan, S., Vidya, R., Rajaram, R. (2009). An Optimal, Distributed Deadlock Detection and Resolution Algorithm for Generalized Model in Distributed Systems. In: Ranka, S., et al. Contemporary Computing. IC3 2009. Communications in Computer and Information Science, vol 40. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03547-0_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-03547-0_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03546-3
Online ISBN: 978-3-642-03547-0
eBook Packages: Computer ScienceComputer Science (R0)