β Scribed by James S. Plank; Yuqun Chen; Kai Li; Micah Beck; Gerry Kingsley
No coin nor oath required. For personal study only.
Checkpointing systems are a convenient way for users to make their programs fault-tolerant by intermittently saving program state to disk and restoring that state following a failure. The main concern with checkpointing is the overhead that it adds to running time of the program. This paper describes memory exclusion, an important class of optimizations that reduce the overhead of checkpointing. Some forms of memory exclusion are well-known in the checkpointing community. Others are relatively new. In this paper, we describe all of them within the same framework. We have implemented these optimization techniques in two checkpointers: libckpt, which works on Unix-based workstations, and CLIP, which works on the Intel Paragon. Both checkpointers are publicly available at no cost. We have checkpointed various long-running applications with both checkpointers and have explored the performance improvements that may be gained through memory exclusion. Results from these experiments are presented and show the improvements in time and space overhead.
π SIMILAR VOLUMES
## Abstract The problems of microcolumn sizeβexclusion chromatography and its instrumentation are considered. It is shown that the reproducibility of retention times of a microβgel chromatograph depends on the stability of eluent delivery by a syringe micropump. It is possible to increase this stab
In this paper, we consider an age-dependent stochastic system with checkpointing and rollback recovery, subject to general failure mode. In the case where the queueing effect for transaction processing is not remarkable, we investigate the stochastic behavior of the system and derive analytically th
Exclusion algorithms are a well-known tool in the area of interval analysis for finding all solutions of a system of nonlinear equations or for finding the global minimum of a function over a compact domain. The present paper discusses a new class of tests for such algorithms in the context of globa