Communications of the ACM

Home/Magazine Archive/September 1974 (Vol. 17, No. 9)/A first order approximation to the optimum checkpoint.../Abstract

A first order approximation to the optimum checkpoint interval

By John W. Young
Communications of the ACM, September 1974, Vol. 17 No. 9, Pages 530-531
10.1145/361147.361115
Comments

View as: Print Mobile App ACM Digital Library Full Text (PDF) Share:

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].

The full text of this article is premium content

No entries found

Log in to Read the Full Article

Sign In

Sign in using your ACM Web Account username and password to access premium content if you are an ACM member, Communications subscriber or Digital Library subscriber.

Need Access?

Please select one of the options below for access to premium content and features.

Create a Web Account

If you are already an ACM member, Communications subscriber, or Digital Library subscriber, please set up a web account to access premium content on this site.

Join the ACM

Become a member to take full advantage of ACM's outstanding computing information resources, networking opportunities, and other benefits.

Subscribe to Communications of the ACM Magazine

Get full access to 50+ years of CACM content and receive the print version of the magazine monthly.

Purchase the Article

Non-members can purchase this article or a copy of the magazine in which it appears.