On self-diagnosable multiprocessor systems: diagnosis by the comparison approach

Author

Sengupta, A. ; Dahbura, A.T.

Author_Institution

Dept. of Comput. Sci., Univ. of South Carolina, Columbia, SC, USA

fYear

1989

fDate

21-23 June 1989

Firstpage

54

Lastpage

61

Abstract

An analysis is made of the diagnosability and diagnosis problems for a model of a self-diagnosable multiprocessor system where processors compare the results of tasks performed by other processors in the system. A set of criteria is given for determining whether the faulty processors in the system can be diagnosed on the basis of the comparisons, and a polynomial-time algorithm is presented to identify the faulty units of such a system on the basis of the comparison results when the system is known to be diagnosable.<>

Keywords

automatic testing; computational complexity; fault tolerant computing; graph theory; multiprocessing systems; MM self-diagnosible system; comparison based t-diagnosible systems; diagnosability; diagnosis by comparison; faulty processors; polynomial-time algorithm; self-diagnosable multiprocessor systems; Automatic testing; Computer science; Fault detection; Fault diagnosis; Multiprocessing systems; Performance analysis; Polynomials; System testing;

fLanguage

English

Publisher

ieee

Conference_Titel

Fault-Tolerant Computing, 1989. FTCS-19. Digest of Papers., Nineteenth International Symposium on

Conference_Location

Chicago, IL, USA

Print_ISBN

0-8186-1959-7

Type

conf

DOI

10.1109/FTCS.1989.105543

Filename

105543