In distributed algorithms, the pieces of the algorithm are run concurrently and independently in different processes over the distributed systems. Deadlocks are very thorny to detect in distributed systems. This is so because no site has precise knowledge about the system, and each inter site communication involves a finite and unpredictable delay. Furthermore in distributed systems, depending on the applications, processes make requests according to different resource model such as Single Resource Model, AND Model, OR Model, AND OR Model, P out of Q Model (generalized model) and Unrestricted Model.