A Hybrid Algorithm for Fast Detection and Resolution of Generalized Deadlocks in Distributed Systems

In the literature only a handful of studies have been performed on the distributed deadlock problem in the generalized request model. Most of those algorithms use either the diffusing computation technique or have the initiator collect all the dependency information among processes. This paper proposes an algorithm which incorporates these two methods with the following properties: first, it removes the reduction phase of the diffusing computation; second, it encodes the dependency information to reduce message length, rather than transmitting it naively as is. The main advantage of the proposed algorithm is that deadlock detection time is reduced to almost half of that of the existing algorithms.