Algorithm-based Fault Tolerance for Parallel Matrix Equation Solvers

Franklin T. Luk

doi:10.1117/12.949703

4 January 1986 Algorithm-based Fault Tolerance for Parallel Matrix Equation Solvers

Franklin T. Luk

Proceedings Volume 0564, Real-Time Signal Processing VIII; (1986) https://doi.org/10.1117/12.949703
Event: 29th Annual Technical Symposium, 1985, San Diego, United States

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.

Citation Download Citation

Franklin T. Luk "Algorithm-based Fault Tolerance for Parallel Matrix Equation Solvers", Proc. SPIE 0564, Real-Time Signal Processing VIII, (4 January 1986); https://doi.org/10.1117/12.949703

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available