Citation
Thomas Huining Feng, Edward A. Lee. "Incremental Checkpointing with Application to Distributed Discrete Event Simulation". Technical report, EECS Dept., University of California Berkeley, 37, April, 2006.

Abstract
Checkpointing is widely used in robust fault-tolerant applications. We present an efficient incremental checkpointing mechanism. It requires to record only the the state changes and not the complete state. After the creation of a checkpoint, state changes are logged incrementally as records in memory, with which an application can spontaneously roll back later. This incrementality allows us to implement checkpointing with high performance. Only small constant time is required for checkpoint creation and state recording. Rollback requires linear time in the number of recorded state changes, which is bounded by the number of state variables times the number of checkpoints. We implement a Java source transformer that automatically converts an existing application into a behavior-preserving one with checkpointing functionality. This transformation is application-independent and application-transparent. A wide range of applications can benefit from this technique. Currently, it has been used for distributed discrete event simulation using the Time Warp technique.

Electronic downloads

• http://www.eecs.berkeley.edu/Pubs/TechRpts/2006/EECS-2006-37.html

• HTML

  Thomas Huining Feng, Edward A. Lee. <a
  href="http://chess.eecs.berkeley.edu/pubs/44.html"
  ><i>Incremental Checkpointing with Application to
  Distributed Discrete Event Simulation</i></a>,
  Technical report,  EECS Dept., University of California
  Berkeley, 37, April, 2006.

• Plain text

  Thomas Huining Feng, Edward A. Lee. "Incremental
  Checkpointing with Application to Distributed Discrete Event
  Simulation". Technical report,  EECS Dept., University
  of California Berkeley, 37, April, 2006.

• BibTeX

  @techreport{FengLee06_IncrementalCheckpointingWithApplicationToDistributed,
      author = {Thomas Huining Feng and Edward A. Lee},
      title = {Incremental Checkpointing with Application to
                Distributed Discrete Event Simulation},
      institution = {EECS Dept., University of California Berkeley},
      number = {37},
      month = {April},
      year = {2006},
      abstract = {Checkpointing is widely used in robust
                fault-tolerant applications. We present an
                efficient incremental checkpointing mechanism. It
                requires to record only the the state changes and
                not the complete state. After the creation of a
                checkpoint, state changes are logged incrementally
                as records in memory, with which an application
                can spontaneously roll back later. This
                incrementality allows us to implement
                checkpointing with high performance. Only small
                constant time is required for checkpoint creation
                and state recording. Rollback requires linear time
                in the number of recorded state changes, which is
                bounded by the number of state variables times the
                number of checkpoints. We implement a Java source
                transformer that automatically converts an
                existing application into a behavior-preserving
                one with checkpointing functionality. This
                transformation is application-independent and
                application-transparent. A wide range of
                applications can benefit from this technique.
                Currently, it has been used for distributed
                discrete event simulation using the Time Warp
                technique.},
      URL = {http://chess.eecs.berkeley.edu/pubs/44.html}
  }
  

Posted by Mary Stewart on 4 May 2006.
For additional information, see the Publications FAQ or contact webmaster at chess eecs berkeley edu.