By Topic

A new algorithm-based fault tolerance technique for computing matrix operations

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Tao, D.L. ; Dept. of Electr. Eng., State Univ. of New York, Stony Brook, NY, USA ; Foo, E. ; Hartmann, C.R.P.

The paper proposes a new algorithm-based fault tolerance (ABFT) technique for computing matrix operations. The scheme provides fault tolerant capability to linear or rectangular processor arrays so that all single PE faults can be tolerated. It also shows that the effect of implementation problems (overflow, round-off errors, and hardware overhead which includes encoding/decoding logic) on the proposed scheme is significantly less than that on other existing schemes

Published in:

Parallel and Distributed Processing, 1991. Proceedings of the Third IEEE Symposium on

Date of Conference:

2-5 Dec 1991