Abstract: This paper compares three different distributed deadlock detection techniques. First, one is on the basis of history-based edge chasing which resolves the deadlock as soon as detects it without waiting for the probe to return back. Another technique is based on model Wait for Graph. This algorithm incrementally constructs and reduces a wait-for graph (WFG) at an initiator process. This WFG is then searched for deadlock. Generally detection is launched from a site when some thread at that site has been waiting for a “long” time in a resource request message. Thirdly, deadlock detection algorithms based on terms of their underlying resource request models, such as AND, OR, and p-out-of-q models.