By Topic

Efficient distributed deadlock detection and resolution using probes, tokens, and barriers

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
$33 $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

3 Author(s)
Young Man Kim ; Dept. of Comput. Sci., Kookmin Univ., Seoul, South Korea ; Ten Hwang Lai ; N. Soundarajan

Probes and tokens are used in many deadlock detection and resolution algorithms. A deadlock is detected by propagating probes along dependency edges. When the initiator pi of a probe receives its probe back, it knows of the existence of a deadlock. pi then sends out a token to clean up those probes in the deadlock; cycle which, if not removed, may later lead to phantom deadlock detections. Only after the token returns to pi is the deadlock resolved by aborting a `victim' (usually pi). As a result, all involved transactions remain waiting and all involved resources locked until the token returns to pi, although the deadlock was already detected when the probe returned to pi. This paper proposes the idea of barriers to allow the deadlock to be resolved without waiting for the token to return to pi, thereby reducing the average deadlock persistence time considerably

Published in:

Parallel and Distributed Systems, 1997. Proceedings., 1997 International Conference on

Date of Conference:

10-13 Dec 1997