Share Email Print
cover

Proceedings Paper

Canonical computational model for algorithm-based fault tolerance (ABFT) systems
Author(s): Ragini Narasimhan; Daniel J. Rosenkrantz; S. S. Ravi
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

Fault tolerance measures (such as fault detectability and fault locatability) of systems employing Algorithm-Based Fault Tolerance (ABFT) are determined by a binary relationship between fault patterns and error patterns. This relationship specifies whether a given fault pattern can induce a given error pattern. We develop a succinct and canonical representation of this relationship and present an efficient algorithm for obtaining this representation. We show that two ABFT systems have the same fault tolerance measures only when their canonical representation are identical.

Paper Details

Date Published: 28 October 1994
PDF: 10 pages
Proc. SPIE 2296, Advanced Signal Processing: Algorithms, Architectures, and Implementations V, (28 October 1994); doi: 10.1117/12.190887
Show Author Affiliations
Ragini Narasimhan, SUNY/Albany (United States)
Daniel J. Rosenkrantz, SUNY/Albany (United States)
S. S. Ravi, SUNY/Albany (United States)


Published in SPIE Proceedings Vol. 2296:
Advanced Signal Processing: Algorithms, Architectures, and Implementations V
Franklin T. Luk, Editor(s)

© SPIE. Terms of Use
Back to Top