A first order approximation to the optimum checkpoint interval

Open Access
Publisher Website
Google Scholar
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].