Paper
28 October 1994 Canonical computational model for algorithm-based fault tolerance (ABFT) systems
Ragini Narasimhan, Daniel J. Rosenkrantz, S. S. Ravi
Author Affiliations +
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.
© (1994) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Ragini Narasimhan, Daniel J. Rosenkrantz, and S. S. Ravi "Canonical computational model for algorithm-based fault tolerance (ABFT) systems", Proc. SPIE 2296, Advanced Signal Processing: Algorithms, Architectures, and Implementations V, (28 October 1994); https://doi.org/10.1117/12.190887
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Tolerancing

Data modeling

Systems modeling

Data processing

Computing systems

Algorithm development

Algorithms

Back to Top