A new scheme for the fault diagnosis of multiprocessor systems

Author

Yang, Xiaofan ; Chen, Tinghuai ; Cao, Zehan ; He, Zhongshi ; Cao, Hongqing

Author_Institution

Comput. Inst., Chongqing Univ., China

fYear

1996

Firstpage

289

Lastpage

294

Abstract

The present paper is concerned with the system-level probabilistic diagnosis problem of multiprocessor systems. First, a new diagnosis algorithm, known as the K-Step-Voting (K-SV) algorithm, is presented. This algorithm generalizes the Majority-Voting (MV) algorithm due to Blough et al. (1992). Then K-SV algorithm is theoretically proved to be better than the MV algorithm. Finally, through computer simulations, the K-SV algorithm is shown to be much superior to the MV algorithm when run on hypercube systems

Keywords

distributed algorithms; fault diagnosis; fault tolerant computing; fault trees; hypercube networks; multiprocessing systems; performance evaluation; probability; BGM model; K-Step-Voting algorithm; PMC model; computer simulations; connection assignment; diagnosis algorithm; fault diagnosis; fault model; fault tolerance; generalised Majority-Voting algorithm; high-performance computing; hypercube systems; multiprocessor systems; pessimistic model; random graphs; system-level probabilistic diagnosis; Computer aided analysis; Computer simulation; Fault diagnosis; Helium; Hypercubes; Multiprocessing systems; Performance evaluation; System testing;

fLanguage

English

Publisher

ieee

Conference_Titel

Test Symposium, 1996., Proceedings of the Fifth Asian

Conference_Location

Hsinchu

ISSN

1085-7735

Print_ISBN

0-8186-7478-4

Type

conf

DOI

10.1109/ATS.1996.555173

Filename

555173