Deadlock Models and a General Algorithm for Distributed Deadlock Detection

Abstract

HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L'archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d'enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.

A Review of Distributed Deadlock Detection Techniques based on Diffusion Computation Approach

“…Based on the underlying resource-request models [1,7], the deadlock detection algorithms are classified into following categories-…”

“…Since the existence of cycle or knot in the WFG are insufficient to determine a deadlock in the generalized model, it is very difficult to detect as well as resolve compared to the AND and OR deadlock. Hence, very few generalized deadlock detection and resolution algorithms [4,5,7,8,10,12,15,16] have been proposed in the literature.…”

An Efficient Detection and Resolution of Generalized Deadlocks in Distributed Systems

“…In WFG, a node represents a process and the edge represents the wait-for relation between processes. Based on the underlying resource-request models [1,7], the deadlock detection algorithms are classified into Single-Resource Model, AND Model, OR Model, P out-of Q model and so on. In the AND model, a process requires all requested resources to continue the execution.…”

“…Since the existence of cycle or knot in the WFG are insufficient to determine a deadlock in the generalized model, it is very difficult to detect as well as resolve as compared to the AND and OR deadlock. Hence, very few generalized deadlock detection and resolution algorithms [4,5,7,8,10,12,15,16] have been proposed in the literature. Amongst, most of them have used the diffusion computing technique [1] in which a process called initiator propagates the probes across the WFG and collects the replies.…”

“…In general, the distributed algorithms [4,5,7,10,12] have recorded the consistent snapshot of distributed WFG and removed the reducible nodes to determine a deadlock in a single or two phase. In Bracha and Toueg [4], the initiator propagates the probes along the WFG edges to record the snapshot in the first phase and the replies are directed towards the initiator in the second phase.…”