Abstract
This paper examines methods of approximating the optimum checkpoint restart strategy for minimizing application run time on a system exhibiting Poisson single component failures. Two different models will be developed and compared. We will begin with a simplified cost function that yields a first-order model. Then we will derive a more complete cost function and demonstrate a perturbation solution that provides accurate high order approximations to the optimum checkpoint interval. © 2004 Elsevier B.V. All rights reserved.
Author supplied keywords
Cite
CITATION STYLE
Daly, J. T. (2006). A higher order estimate of the optimum checkpoint interval for restart dumps. In Future Generation Computer Systems (Vol. 22, pp. 303–312). https://doi.org/10.1016/j.future.2004.11.016
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.