Algorithm-Based Fault Tolerance for Dense Matrix Factorizations
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 paper proposes a new hybrid approach, based on Algorithm-Based Fault Tolerance (ABFT), to help matrix factorizations algorithms survive fail-stop failures. The authors consider extreme conditions, such as the absence of any reliable component and the possibility of losing both data and checksum from a single failure.
Provided by: Association for Computing Machinery Topic: Data Centers Date Added: Feb 2012 Format: PDF