Diagnosability and diagnosis of algorithm-based fault tolerant systems

Bapiraju Vinnakota, Niraj K. Jha

Research output: Contribution to conferencePaperpeer-review

2 Scopus citations

Abstract

Multiprocessor architectures are now in common use for signal processing and other computation-intensive applications. These applications are characterized by high-speed data processing and/or long processing periods. It is therefore desirable that any erroneous data produced by the system be detected as quickly as possible, and that the faulty processors producing the erroneous data be located and reconfigured out of the system. Algorithm-based fault tolerance (ABFT) is a low-cost, system-level concurrent error detection scheme that can also be used for locating faulty processors. Graph-theoretic and matrix-based models have been developed for the analysis of systems using ABFT. These models are used to analyze a system for its fault diagnosability. Methods used in the analysis of multiprocessor systems using system-level diagnosis are applied to the analysis of ABFT systems. Using these methods, an improved diagnosability algorithm is provided. An efficient diagnosis algorithm for ABFT systems for identifying the faulty processors, if any exist, from the information available is given. No such algorithm was known before.

Original languageEnglish (US)
Pages28-31
Number of pages4
StatePublished - Dec 1 1990
EventProceedings of the 32nd Midwest Symposium on Circuits and Systems Part 2 (of 2) - Champaign, IL, USA
Duration: Aug 14 1989Aug 16 1989

Other

OtherProceedings of the 32nd Midwest Symposium on Circuits and Systems Part 2 (of 2)
CityChampaign, IL, USA
Period8/14/898/16/89

All Science Journal Classification (ASJC) codes

  • Electronic, Optical and Magnetic Materials
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Diagnosability and diagnosis of algorithm-based fault tolerant systems'. Together they form a unique fingerprint.

Cite this