Share Email Print

Proceedings Paper

Multiple Error Algorithm-Based Fault Tolerance For Matrix Triangularizations
Author(s): Haesun Park
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

The checksum methods have been known as the most efficient fault-tolerant matrix triangularization schemes on systolic arrays in the presence of a single transient error. But it is not realistic to expect that at most one transient error occurs during any computation. In this paper, we extend the existing checksum schemes and introduce a block checksum scheme for multiple transient errors applicable to the fault tolerant matrix LU decomposition, Gaussian elimination with pairwise pivoting, and the QR decomposition. The block checksum scheme can detect, locate, and correct one transient error in each submatrix of a given matrix. Then we introduce examples that show that even one transient error can make the corrected results by factorization updates useless due to rounding errors. We also show that by introducing d weighted checksum vectors, we can detect all the transient errors that occur in a maximum of d different columns in matrix triangularizations.

Paper Details

Date Published: 23 February 1988
PDF: 10 pages
Proc. SPIE 0975, Advanced Algorithms and Architectures for Signal Processing III, (23 February 1988);
Show Author Affiliations
Haesun Park, University of Minnesota (United States)

Published in SPIE Proceedings Vol. 0975:
Advanced Algorithms and Architectures for Signal Processing III
Franklin T. Luk, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?