Abstract
We describe a simple and efficient algorithm to detect deadlocks in distributed systems. In our model, processes requestN resources from a pool of sizeM. This is a generalization of the well-knownAND-OR request model. The algorithm is incrementally derived and proven correct. Its communication, computational, and space requirements are lower than those of the best previously known algorithms for the simplerAND-OR model.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Beeri C, Obermarck R (1981) A resource class independent deadlock detection algorithm. Res Rep RJ3077, IBM Res Lab, San Jose, California (March 1981)
Chandy KM, Lamport L (1985) Distributed snapshots: determining global states of distributed systems. ACM Trans Comput Syst 3(1):63–75
Chandy KM, Misra J (1982) A distributed algorithm for detecting resource deadlocks in distributed systems. Proc 1st ACM Symp Principles Distributed Comput, Ottawa, Canada, (August 1982) pp 157–164
Chandy KM, Haas LM, Misra J (1983) Distributed deadlock detection. ACM Trans Comput Syst 1(2):144–156
Chang E (1980) Echo algorithms: depth parallel operations on general graphs. IEEE Trans Software Eng SE-8(4):391–401
Gifford DK (1979) Weighted voting for replicated data. Proc Seventh Symp Operating Syst Principles (December 1979), pp 150–162
Gligor VG, Shattuck SH (1980) On deadlock detection in distributed systems. IEEE Trans Software Eng 6(5):435–440
Haas LM, Mohan C (1983) A distributed deadlock detection algorithm for a resource-based system. Res Rep RJ3765, IBM Res Lab San Jose, California (January 1983)
Herman T, Chandy KM (1983) A distributed procedure to detect AND/OR deadlock. Tech Rep LCS-8301, Dep Comput Sci, University of Texas, Austin, Texas (February 1983)
Ho GS, Ramamoorthy CV (1982) Protocols for deadlock detection in distributed database systems. IEEE Trans Software Eng 8(6):554–557
Hoare CAR (1978) Communicating sequential processes. Commun ACM 21(8):666–677
Holt RC (1972) Some deadlock properties of computer systems. ACM Comput Surv 4(3):179–196
Kim JK (1984) Deadlock detection algorithms in distributed database systems. Tech Rep R-84-1162, Dep Comput Sci, University of Illinois at Urbana-Champaign. Urbana, Illinois (February 1984)
Lamport L (1978) Time, clocks and the ordering of events in a distributed system. Commun ACM 21(7):558–565
Menasce DA, Muntz RR (1979) Locking and deadlock detection in distributed data bases. IEEE Trans Eng 5(3):195–202
Obermarck R (1980) Deadlock detection for all resource classes. Res Rep RJ2955, IBM Lab, San Jose, California, (October 1980)
Obermarck R (1982) Distributed deadlock detection algorithm. ACM Trans Database 7(2):187–208
Author information
Authors and Affiliations
Additional information
Gabriel Bracha received his B.Sc. Degree in Mathematics (Computer Science option) from Tel-Aviv University, Israel, in 1980, and his Ph.D. degree in Computer Science from Cornell University, Ithaca, NY, in 1985.
In 1985, he joined Daisy System, in Tel-Aviv, Israel, where he is currently a Senior Researcher His current research interests include computational geometry, distributed computing, and fault-tolerance.
Partial support for this work was provided by the National Science Foundation under grant MCS 83-03135
For photograph and biography see Distributed Computing (1987) 2:80–94
Rights and permissions
About this article
Cite this article
Bracha, G., Toueg, S. Distributed deadlock detection. Distrib Comput 2, 127–138 (1987). https://doi.org/10.1007/BF01782773
Issue Date:
DOI: https://doi.org/10.1007/BF01782773