A distributed algorithm for deadlock detection under OR-request model

This paper presents a distributed algorithm for detecting deadlocks in the OR request model in distributed systems. The initiator of the algorithm builds a reduced local wait-for graph to determine a deadlock by employing two phases for probe propagation and receiving replies. The proposed algorithm exhibits faster deadlock detection and shorter blocked time of processes than the current algorithms. Furthermore, the deadlock resolution is simplified without any additional message transmission.