By Topic

A low communication cost algorithm for distributed deadlock detection and resolution

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

5 Author(s)
Cordoba, A. ; Dpto. Matematica e Informatica, Univ. Publica de Navarra, Pamplona, Spain ; Farina, F. ; Garitagoitia, J.R. ; de Mendivil, J.R.G.
more authors

This work introduces a new distributed history-based algorithm for deadlock detection and resolution under the single-unit request model. The algorithm has a communication cost of O(n /spl middot/ log n) messages for a deadlock cycle of n processes. This low cost is achieved by means of two mechanisms. On one hand, to reduce the number of instance initializations, a node compares the priorities between its immediate successor and all its predecessors, starting the algorithm only if an antagonistic conflict is given. On the other hand, each instance of the algorithm runs at a certain detection level and does not retransmit probes created by instances running at a lower detection level. An instance can switch to a higher level depending on the information received in the probes.

Published in:

Parallel, Distributed and Network-Based Processing, 2003. Proceedings. Eleventh Euromicro Conference on

Date of Conference:

5-7 Feb. 2003