Checkpointing algorithms and fault prediction
Distributed, Parallel, and Cluster Computing
2013-12-05 v2
Abstract
This paper deals with the impact of fault prediction techniques on checkpointing strategies. We extend the classical first-order analysis of Young and Daly in the presence of a fault prediction system, characterized by its recall and its precision. In this framework, we provide an optimal algorithm to decide when to take predictions into account, and we derive the optimal value of the checkpointing period. These results allow to analytically assess the key parameters that impact the performance of fault predictors at very large scale.
Cite
@article{arxiv.1302.3752,
title = {Checkpointing algorithms and fault prediction},
author = {Guillaume Aupy and Yves Robert and Frédéric Vivien and Dounia Zaidouni},
journal= {arXiv preprint arXiv:1302.3752},
year = {2013}
}
Comments
Supported in part by ANR Rescue. Published in Journal of Parallel and Distributed Computing. arXiv admin note: text overlap with arXiv:1207.6936