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 …

Maintaining the performance of high-performance computing (HPC) applications as failures
increase is a major challenge for next-generation extreme-scale systems. Recent work …

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

Checkpointing is a popular resilience method in HPC and its efficiency highly depends on
the choice of the checkpoint interval. Standard analytical approaches optimize intervals for …

This paper revisits replication coupled with checkpointing for fail-stop errors. Replication
enables the application to survive many fail-stop errors, thereby allowing for longer …

This article studies checkpointing strategies for parallel applications subject to failures. The
optimal strategy to minimize total execution time, or makespan, is well known when failure …

Bigger systems are being deployed by High Performance Computing centers in order to
fulfill the needs of modern scientific and big data applications as well as to match the …

The thesis is concerned with online mapping and scheduling of tasks on multiprocessor
embedded systems in order to improve the reliability subject to various constraints regarding …

This paper studies checkpointing strategies for parallel jobs subject to fail-stop errors. The
optimal strategy is well known when failure inter-arrival times obey an Exponential law, but it …

This thesis addresses the problem of resilience in large-scale computer systems. Due to the
rapid development of high-performance computing technology, it has become crucial to …