×

A distributed deadlock detection algorithm: Distributed graph reconstruction algorithm. (English) Zbl 0669.68022

A new algorithm for the distributed deadlock detection problem in the communication model of a distributed system is described. The new algorithm is called distributed graph reconstruction (DGR) algorithm. To represent the state of the system, a Wait-For-Graph is used. Doing the reconstruction of the Wait-For-Graph a cycle can be detected in the graph. The DGR algorithm can detect all existing deadlocks and does not detect false deadlock.
The algorithm detects the deadlock with the complexity of messages \(O(n^ 2)\).
Reviewer: E.Kostolansky

MSC:

68N25 Theory of operating systems
68Q60 Specification and verification (program logics, model checking, etc.)
68N99 Theory of software
68W99 Algorithms in computer science
05C38 Paths and cycles
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Bracha, G.; Toueg, S., A distributed algorithm for generalized deadlock detection, Proc. 3rd Symp. on Principles of Distributed Computing, 285-301 (August 1984), Vancouver, Canada
[2] Chandy, K. M.; Misra, J., Distributed deadlock detection, ACM Trans. Comput. Syst., 1, 2, 144-150 (1983)
[3] Isloor, S. S.; Marsland, T. A., The deadlock problem; an overview, IEEE Comput., 13, 9, 58-78 (1980)
[4] M. Maekawa, Distributed deadlock detection algorithms without phantom deadlocks, Technical Report 83-11, Department of Information Science, University of Tokyo, Tokyo, Japan.; M. Maekawa, Distributed deadlock detection algorithms without phantom deadlocks, Technical Report 83-11, Department of Information Science, University of Tokyo, Tokyo, Japan.
[5] Natarajan, N., A distributed scheme for detecting communication deadlocks, IEEE Trans. Software. Eng., SE-12, 4 (1986)
[6] Obermack, R., Distributed deadlock detection algorithm, ACM Trans. Database Syst., 7, 2, 187-208 (1982)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.