A distributed algorithm for resource deadlock detection

A simple algorithm for the problem of deadlock detection in distributed systems is presented. In the proposed algorithm, the authors do not use probe messages to detect deadlock. Instead the authors use the update message whose function is twofold: first to modify the wait-for variables and second to check the occurrence of deadlock. The proposed algorithm ensures that only one process in the deadlock cycle will detect it, thus simplifying the resolution problem. All true deadlocks are detected in finite time and no false deadlocks are reported. An informal proof of correctness of the algorithm and an example are also presented.<
>