The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.05 - May (1991 vol.17)
pp: 436-442
ABSTRACT
<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>
INDEX TERMS
optimal total processing time; optimal checkpoint schedule; unreliable computing systems; multiclient computer service; data transmissions; optimisation; programming theory; scheduling
CITATION
B. Dimitrov, Z. Khalil, N. Kolev, P. Petrov, "On the Optimal Total Processing Time Using Checkpoints", IEEE Transactions on Software Engineering, vol.17, no. 5, pp. 436-442, May 1991, doi:10.1109/32.90446
17 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool