Optimistic recovery in distributed systems
ACM Transactions on Computer Systems (TOCS)
ACM Transactions on Programming Languages and Systems (TOPLAS)
GTW: a time warp system for shared memory multiprocessors
WSC '94 Proceedings of the 26th conference on Winter simulation
The treatment of state in optimistic systems
PADS '95 Proceedings of the ninth workshop on Parallel and distributed simulation
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Transparent incremental state saving in time warp parallel discrete event simulation
PADS '96 Proceedings of the tenth workshop on Parallel and distributed simulation
Automatic incremental state saving
PADS '96 Proceedings of the tenth workshop on Parallel and distributed simulation
Incremental state saving in SPEEDES using C++
WSC '93 Proceedings of the 25th conference on Winter simulation
PLDI '98 Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation
Refactoring: improving the design of existing code
Refactoring: improving the design of existing code
Oracle essentials: Oracle9i, Oracle8i & Oracle8 (2nd ed.)
Oracle essentials: Oracle9i, Oracle8i & Oracle8 (2nd ed.)
Efficient Incremental Checkpointing of Java Programs
DSN '00 Proceedings of the 2000 International Conference on Dependable Systems and Networks (formerly FTCS-30 and DCCA-8)
ATEC '99 Proceedings of the annual conference on USENIX Annual Technical Conference
A fully distributed data collection method for HLA based distributed simulations
SCSC '09 Proceedings of the 2009 Summer Computer Simulation Conference
A RULE-BASED DOMAIN SPECIFIC LANGUAGE FOR FAULT MANAGEMENT
Journal of Integrated Design & Process Science
Hi-index | 0.00 |
Checkpointing is widely used in robust fault-tolerant applications. We present an efficient incremental checkpointing mechanism. It requires to record only 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 incrementalism 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.