This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Checkpointing and Rollback-Recovery for Distributed Systems
January 1987 (vol. 13 no. 1)
pp. 23-31
R. Koo, Department of Computer Science, Cornell University
We consider the problem of bringing a distributed system to a consistent state after transient failures. We address the two components of this problem by describing a distributed algorithm to create consistent checkpoints, as well as a rollback-recovery algorithm to recover the system to a consistent state. In contrast to previous algorithms, they tolerate failures that occur during their executions. Furthermore, when a process takes a checkpoint, a minimal number of additional processes are forced to take checkpoints. Similarly, when a process rolls back and restarts after a failure, a minimal number of additional processes are forced to roll back with it. Our algorithms require each process to store at most two checkpoints in stable storage. This storage requirement is shown to be minimal under general assumptions.
Index Terms:
rollback-recovery, Checkpoint, consistent state, distributed systems, fault-tolerance
Citation:
R. Koo, S. Toueg, "Checkpointing and Rollback-Recovery for Distributed Systems," IEEE Transactions on Software Engineering, vol. 13, no. 1, pp. 23-31, Jan. 1987, doi:10.1109/TSE.1987.232562
Usage of this product signifies your acceptance of the Terms of Use.