Assuming failure independence: are we right to be wrong?

Guillaume Aupy 1 Yves Robert 2, 3 Frédéric Vivien 3, 4
1 TADAAM - Topology-Aware System-Scale Data Management for High-Performance Computing
LaBRI - Laboratoire Bordelais de Recherche en Informatique, Inria Bordeaux - Sud-Ouest
3 ROMA - Optimisation des ressources : modèles, algorithmes et ordonnancement
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
Abstract : This paper revisits the failure 1 temporal independence hypothesis which is omnipresent in the analysis of resilience methods for HPC. We explain why a previous approach is incorrect , and we propose a new method to detect failure cascades, i.e., series of non-independent consecutive failures. We use this new method to assess whether public archive failure logs contain failure cascades. Then we design and compare several cascade-aware checkpointing algorithms to quantify the maximum gain that could be obtained, and we report extensive simulation results with archive and synthetic failure logs. Altogether, there are a few logs that contain cascades, but we show that the gain that can be achieved from this knowledge is not significant. The conclusion is that we can wrongly, but safely, assume failure independence!
Liste complète des métadonnées

Cited literature [24 references]  Display  Hide  Download

https://hal.inria.fr/hal-01654639
Contributor : Guillaume Aupy <>
Submitted on : Monday, December 4, 2017 - 11:17:09 AM
Last modification on : Friday, April 20, 2018 - 3:44:27 PM

File

fts2017.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01654639, version 1

Citation

Guillaume Aupy, Yves Robert, Frédéric Vivien. Assuming failure independence: are we right to be wrong?. FTS 2017 - 3rd International Workshop on Fault-Tolerant Systems, Sep 2017, Honolulu (HI), United States. pp.1-8. ⟨hal-01654639⟩

Share

Metrics

Record views

160

Files downloads

34