Cholesky decomposition is a widely used algorithm to solve linear equations with symmetric
and positive definite coefficient matrix. With large matrices, this often will be performed on …

Soft errors in scientific computing applications are becoming inevitable with the ever-
increasing system scale and execution time, and new technologies that feature increased …

This paper presents Phoenix, a communication and synchronization substrate that
implements a novel protocol for recovering from fail-stop faults when executing graph …

Fault resilience has became a major issue for HPC systems, in particular in the perspective
of future E-scale systems, which will consist of millions of CPU cores and other components …

Fault tolerance is increasingly important in high performance computing due to the
substantial growth of system scale and decreasing system reliability. In-memory/diskless …

The mean time between failures of upcoming exascale systems is expected to be one hour
or less. To be able to successfully complete execution of applications in such scenarios …

Fault tolerance is increasingly important in high-performance computing due to the
substantial growth of system scale and decreasing system reliability. In-memory/diskless …

Checkpoint and recovery cost imposed by coordinated checkpoint/restart (CCP/R) is a
crucial performance issue for high performance computing (HPC) applications. In …

Fault tolerance overhead of high performance computing (HPC) applications is becoming
critical to the efficient utilization of HPC systems at large scale. Today's HPC applications …

As the computing power of supercomputers continues to increase exponentially the mean
time between failures (mtbf) is decreasing. Checkpoint-restart has historically been the …