Algorithm-based Fault Tolerance for Parallel Matrix Equation Solvers
Franklin T. Luk · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · 1986
We examine the checksum schemes of Abraham et al. for the computation of the LU-factorization using a multiprocessor array. Their methods are very efficient for detecting a transient error, but quite expensive for correcting it due to the need for a computation rollback. In this paper, we show how to avoid the rollback and how to implement pivoting. We also introduce a new checksum method for solving triangular sets of linear equations.