4 January 1986 Algorithm-based Fault Tolerance for Parallel Matrix Equation Solvers
Author Affiliations +
Abstract
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.
© (1986) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Franklin T. Luk, Franklin T. Luk, } "Algorithm-based Fault Tolerance for Parallel Matrix Equation Solvers", Proc. SPIE 0564, Real-Time Signal Processing VIII, (4 January 1986); doi: 10.1117/12.949703; https://doi.org/10.1117/12.949703
PROCEEDINGS
7 PAGES


SHARE
RELATED CONTENT

Modified Faddeev Algorithm For Matrix Manipulation
Proceedings of SPIE (November 28 1984)
A Novel MVDR Beamforming Algorithm
Proceedings of SPIE (January 21 1988)
An Analysis Of Algorithm-Based Fault Tolerance Techniques
Proceedings of SPIE (April 04 1986)
Implementation Of Cellular Arrays
Proceedings of SPIE (July 30 1982)
Choosing Small Weights For Multiple Error Detection
Proceedings of SPIE (May 17 1989)

Back to Top