The Performance of Consistent Checkpointing (1992)
Cached
Download Links
- [ftp.cs.ucsd.edu]
- [www.cs.cmu.edu]
- [www.cs.rice.edu]
- [infoscience.epfl.ch]
- DBLP
Other Repositories/Bibliography
| Venue: | In Proceedings of the 11th Symposium on Reliable Distributed Systems |
| Citations: | 181 - 9 self |
BibTeX
@INPROCEEDINGS{Elnozahy92theperformance,
author = {Elmootazbellah Nabil Elnozahy and David B. Johnson and Willy Zwaenepoel},
title = {The Performance of Consistent Checkpointing},
booktitle = {In Proceedings of the 11th Symposium on Reliable Distributed Systems},
year = {1992},
pages = {39--47}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Consistent checkpointing provides transparent fault tolerance for long-running distributed applications. In this paper we describe performance measurements of an implementation of consistent checkpointing. Our measurements show that consistent checkpointing performs remarkably well. We executed eight compute-intensive distributed applications on a network of 16 diskless Sun-3/60 workstations, comparing the performance without checkpointing to the performance with consistent checkpoints taken at 2-minute intervals. For six of the eight applications, the running time increased by less than 1% as a result of the checkpointing. The highest overhead measured for any of the applications was 5.8%. Incremental checkpointing and copy-on-write checkpointing were the most effective techniques in lowering the running time overhead. These techniques reduce the amount of data written to stable storage and allow the checkpoint to proceed concurrently with the execution of the processes. The overhead ...
