By Topic

Efficient algorithms for detection and resolution of distributed deadlocks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Shigang Chen ; Sch. of Comput. Sci., Florida Int. Univ., Miami, FL, USA ; Yi Deng ; Wei Sun ; Rishe, N.

We present a simple and efficient distributed algorithm for detecting generalised deadlocks in distributed systems. Unlike previous algorithms, which are all based on the idea of distributed snapshot, and require multiple rounds of message transfers along the edges of the global wait-for graph (WFG), the proposed algorithm uses a novel approach that incrementally constructs an “image” of the WFG at an initiator node. The algorithm has time complexity of d+1 and message complexity of e+n, where n is the number of nodes, d the diameter, and e the number of edges of the WFG. Compared with the best existing algorithm, our algorithm notably reduces both time and message complexities. Correctness proof and performance analysis for the algorithm are provided. In addition, the new approach simplifies deadlock resolution. An extension to the algorithm is presented to handle generalized-deadlock resolution with only a slight increase to the message complexity

Published in:

Parallel and Distributed Processing, 1995. Proceedings. Seventh IEEE Symposium on

Date of Conference:

25-28 Oct 1995