Abstract
This paper presents a distributed algorithm to detect deadlocks in distributed data bases. Features of this paper are (I) 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.
Cite
CITATION STYLE
Chandy, X. M., & Misra, J. (1982). A distributed algorithm for detecting resource deadlocks in distributed systems. In Proceedings of the Annual ACM Symposium on Principles of Distributed Computing (pp. 157–164). Association for Computing Machinery. https://doi.org/10.1145/800220.806693
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
