loading...
On Node State Reconstruction for Fault Tolerant Distributed Algorithms
Osaka University, Suita, Japan October 13-October 16
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/RELDIS.2002.118018421st IEEE Symposium on Reliable Distr ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Michael Okun, Hebrew University of Jerusalem
Amnon Barak, Hebrew University of Jerusalem
One of the main methods for achieving fault tolerance in distributed systems is recovery of the state of failed components. Though generic recovery methods like checkpointing and message logging exist, in many cases the recovery has to be application specific. In this paper we propose a general model for a node state reconstruction after crash failures. In our model the reconstruction operation is defined only by the requirements it fulfills, without referring to the specific application dependent way it is performed. The model provides a framework for formal treatment of algorithm-specific and system-specific recovery procedures. It is used to specify node state reconstruction procedures for several widely used distributed algorithms and systems, as well as to prove their correctness.
Index Terms:
Distributed algorithms, fault tolerance, state reconstruction, recovery
Citation:
Michael Okun, Amnon Barak, "On Node State Reconstruction for Fault Tolerant Distributed Algorithms," srds, pp.160, 21st IEEE Symposium on Reliable Distributed Systems (SRDS'02), 2002
Usage of this product signifies your acceptance of the Terms of Use.