A distributed algorithm for detecting resource deadlocks in distributed systems

K. Mani Chandy, Jayadev Misra · 1982

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.

Read the paper · More papers on PaperTik