arrow
Return

Multi-level checkpointing and silent error detection for linear workflows

delete2018-09-01
delete11
delete
OA
AI
A
Anne Benoît
A
Aurélien Cavelan
Y
Yves Robert *
H
Hongyang Sun
DOI:10.1016/j.jocs.2017.03.024delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
We focus on High Performance Computing (HPC) workflows whose dependency graph forms a linear chain, and we extend single-level checkpointing in two important directions. Our first contribution targets silent errors, and combines in-memory checkpoints with both partial and guaranteed verifications. Our second contribution deals with multi-level checkpointing for fail-stop errors. We present sophisticated dynamic programming algorithms that return the optimal solution for each problem in polynomial time. We also show how to combine all these techniques and solve the problem with both fail-stop and silent errors. Simulation results demonstrate that these extensions lead to significantly improved performance compared to the standard single-level checkpointing algorithm. (C) 2017 Elsevier B.V. All rights reserved.
Keywords:
Fault-tolerance
Fail-stop errors
Silent errors
Multi-level checkpointing
Error detection
Verification mechanism
Linear workflows
Dynamic programming algorithm
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Nature Computational Science cover
Nature Computational Science
IF:
18.3
Papers:
3.1K
Citations:
4.0K

Organization

E
ecole normale superieure de lyon (ens de lyon)
Scholars:
5.1K
Papers: 3.6K
Citations: 6