An Efficient Detection and Resolution of Generalized Deadlocks in Distributed Systems

In this paper, the authors propose a new algorithm to detect and resolve distributed deadlocks in the generalized model. The initiator of the proposed algorithm diffuses the probes along the outgoing edges of Wait-For Graph (WFG) and collects the replies that carry the dependency information between processes directly. However, the initiator simplifies the unblocking conditions of blocked nodes in response to a reply form an unblocked node and receives almost two replies from any node unlike the earlier algorithms. It finally declares all the nodes that have not been reduced as deadlocked.

Provided by: International Journal of Computer Applications Topic: Data Management Date Added: Aug 2010 Format: PDF

Download Now

Find By Topic