A distributed algorithm for detecting deadlocks under the OR model and the resolution based on hardware clocks

In this paper we propose a distributed algorithm for detecting deadlocks in the OR request model using a roughly synchronized global time base in the system. The correctness of the algorithm is proven. A new approach for detecting a knot in a distributed graph is proposed. In the approach each process maintains an integer, the "token remainder", to keep track of the tokens in transition during a deadlock detection computation. The algorithm terminates when the token remainder is set to zero. We define a trapdoor node and explain its importance in deadlock detection under the OR model. Compared with existing works our algorithm is more efficient in terms of message usage. It is also straightforward to implement.