loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
24th International Conference on Distributed Computing Systems Workshops - W5: ADSN (ICDCSW'04)
Finding a Recovery Line in Uncoordinated Checkpointing
Hachioji, Tokyo, Japan
March 23-March 24
ISBN: 0-7695-2087-1
Mamoru Ohara, Tokyo Metropolitan University
Masayuki Arai, Tokyo Metropolitan University
Satoshi Fukumoto, Tokyo Metropolitan University
Kazuhiko Iwasaki, Tokyo Metropolitan University
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 .nding 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.
Citation:
Mamoru Ohara, Masayuki Arai, Satoshi Fukumoto, Kazuhiko Iwasaki, "Finding a Recovery Line in Uncoordinated Checkpointing," icdcsw, vol. 5, pp.628-633, 24th International Conference on Distributed Computing Systems Workshops - W5: ADSN (ICDCSW'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.