A first order approximation to the optimum checkpoint interval
A first order approximation to the optimum checkpoint interval
复制标题
DOI:
10.1145/361147.361115
复制
发表时间:
1974-09
期刊:
影响因子:
--
通讯作者:
J. W. Young
中科院分区:
文献类型:
--
作者:
J. W. Young
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].