ACM Home Page
Please provide us with feedback. Feedback
A first order approximation to the optimum checkpoint interval
Full text PdfPdf (173 KB)
Source
Communications of the ACM archive
Volume 17 ,  Issue 9  (September 1974) table of contents
Pages: 530 - 531  
Year of Publication: 1974
ISSN:0001-0782
Author
John W. Young  Martin Marietta Corp., Orlando, FL
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 15,   Downloads (12 Months): 78,   Citation Count: 33
Additional Information:

abstract   references   cited by   index terms  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/361147.361115
What is a DOI?

ABSTRACT

To avoid having to restart a job from the beginning in case of random failure, it is standard practice to save periodically sufficient information to enable the job to be restarted at the previous point at which information was saved. Such points are referred to as checkpoints, and the saving of such information at these points is called checkpointing [1].


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Jasper, David P. A discussion of checkpoint/restart. Software Age (Oct. 1969), 9-14.

CITED BY  33