Loading [a11y]/accessibility-menu.js
Finding a recovery line in uncoordinated checkpointing | IEEE Conference Publication | IEEE Xplore

Finding a recovery line in uncoordinated checkpointing


Abstract:

In distributed systems running uncoordinated checkpointing schemes, a process should maintain several generations of local checkpoints to improve dependability, because a...Show More

Abstract:

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.
Date of Conference: 23-24 March 2004
Date Added to IEEE Xplore: 24 August 2004
Print ISBN:0-7695-2087-1
Conference Location: Tokyo, Japan

References

References is not available for this document.