We consider the problem of orchestrating the execution of workflow applications structured
as Directed Acyclic Graphs (DAGs) on parallel computing platforms that are subject to fail …

Abstract We focus on High Performance Computing (HPC) workflows whose dependency
graph forms a linear chain, and we extend single-level checkpointing in two important …

This work deals with scheduling and checkpointing strategies to execute scientific workflows
on failure-prone large-scale platforms. To the best of our knowledge, this work is the first to …

Abstract The Young/Daly formula provides an approximation of the optimal checkpointing
period for a parallel application executing on a supercomputing platform. It was originally …

Large-scale platforms currently experience errors from two different sources, namely fail-
stop errors (which interrupt the execution) and silent errors (which strike unnoticed and …

We study the scheduling of computational workflows on compute resources that experience
exponentially distributed failures. When a failure occurs, rollback and recovery is used to …

Errors have become a critical problem for high-performance computing. Checkpointing
protocols are often used for error recovery after fail-stop failures. However, silent errors …

Incremental checkpointing, which is intended to minimize checkpointing overhead, saves
only the modified pages of a process. However, the cumulative size of incremental …

This work provides an optimal checkpointing strategy to protect iterative applications from
fail-stop errors. We consider a general framework, where the application repeats the same …

Incremental checkpointing, which is intended to minimize checkpointing overhead, saves
only the modified pages of a process. This means that in incremental checkpointing, the time …