By Topic

Finding a recovery line in uncoordinated checkpointing

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)
Ohara, M. ; Graduate Sch. of Eng., Tokyo Metropolitan Univ., Japan ; Arai, M. ; Fukumoto, S. ; Iwasaki, K.

In distributed systems running uncoordinated checkpointing schemes, a process should maintain several generations of local checkpoints to improve dependability, because a global checkpoint, which is a set of local checkpoints, is not always consistent. In this paper, we present an algorithm for finding a recovery line, where a given checkpoint is the earliest, in uncoordinated checkpointing schemes. Numerical examples of probability for the existence of a recovery line calculated with the proposed algorithm are also presented.

Published in:

Distributed Computing Systems Workshops, 2004. Proceedings. 24th International Conference on

Date of Conference:

23-24 March 2004