June 22–26, 2014
Leipzig, Germany

Presentation Details

Name: Fault Tolerance in Numerical Library Routines
Time: Tuesday, June 24, 2014
02:15 pm - 02:45 pm
Room:   Hall 1
CCL - Congress Center Leipzig
Breaks:01:00 pm - 02:15 pm Lunch
Speaker:   Jack Dongarra, University of Tennessee & ORNL
Abstract:   Dense matrix factorizations, such as LU, Cholesky and QR, are widely used for scientific applications that require solving systems of linear equations, eigenvalues and linear least squares problems.  Such computations are normally carried out on supercomputers, whose ever-growing scale induces a fast decline of the Mean Time To Failure (MTTF). This talk proposes a new hybrid approach, based on Algorithm-Based Fault Tolerance (ABFT), to help matrix factorizations algorithms survive fail-stop failures. We consider extreme conditions, such as the absence of any reliable component and the possibility of loosing both data and checksum from a single failure. We will present a generic solution for protecting the right factor, where the updates are applied, of all above mentioned factorizations.