<title>Canonical computational model for algorithm-based fault tolerance (ABFT) systems</title>

Ragini Narasimhan, Daniel J. Rosenkrantz, S. S. RaviProceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE 1994 · DOI

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.
BibTeX
@inproceedings{narasimhan1994lt,
  author = {Ragini Narasimhan and Daniel J. Rosenkrantz and S. S. Ravi},
  title = {{\<title\>Canonical computational model for algorithm-based fault tolerance (ABFT) systems\</title\>}},
  booktitle = {Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE},
  year = {1994},
  doi = {10.1117/12.190887},
}

Loading related content...

Figure