Issue No. 05 - May (1991 vol. 17)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/32.90446
<p>The authors investigate the problem of optimizing the expected blocking time duration by providing a schedule of checkpoints during the required job processing time. They give a general approach for determining the optimal checkpoint schedule and derive some cases when the optimal checkpointing is uniform. The model has applications in unreliable computing systems, multiclient computer service, data transmissions, etc.</p>
optimal total processing time; optimal checkpoint schedule; unreliable computing systems; multiclient computer service; data transmissions; optimisation; programming theory; scheduling
P. Petrov, N. Kolev, Z. Khalil and B. Dimitrov, "On the Optimal Total Processing Time Using Checkpoints," in IEEE Transactions on Software Engineering, vol. 17, no. , pp. 436-442, 1991.