A Caltech Library Service

A distributed algorithm for detecting resource deadlocks in distributed systems

Chandy, K. M. and Misra, J. (1982) A distributed algorithm for detecting resource deadlocks in distributed systems. In: Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing. Association for Computing Machinery , New York, NY, pp. 157-164. ISBN 0-89791-081-8.

Full text is not posted in this repository. Consult Related URLs below.

Use this Persistent URL to link to this item:


This paper presents a distributed algorithm to detect deadlocks in distributed data bases. Features of this paper are (1) a formal model of the problem is presented, (2) the correctness of the algorithm is proved, i.e. we show that all true deadlocks will be detected and deadlocks will not be reported falsely, (3) no assumptions are made other than that messages are received correctly and in order and (4) the algorithm is simple.

Item Type:Book Section
Related URLs:
URLURL TypeDescription
Additional Information:© 1982 ACM. This work was supported in part by the Air Force Office of Scientific Research under grant AFOSR 81-0205 and the University Research Institute at The University of Texas. Our work in this general area resulted from reading a seminal paper by Dijkstra and Scholten on termination detection [2] and by later discussions with them. Virgil Gligor showed us that the DDB problem, though apparently simple, was non-trivial and interesting, and led us to the sizable body of work on the subject.
Funding AgencyGrant Number
Air Force Office of Scientific Research (AFOSR)81-0205
University of TexasUNSPECIFIED
Record Number:CaltechAUTHORS:20190111-135906881
Persistent URL:
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:92220
Deposited By: Tony Diaz
Deposited On:12 Jan 2019 17:05
Last Modified:16 Nov 2021 03:48

Repository Staff Only: item control page