Title :
An Efficient Algorithm for Identifying the Most Likely Fault Set in a Probabilistically Diagnosable System
Author :
Dahbura, Anton T.
Author_Institution :
AT&T Bell Laboratories
fDate :
4/1/1986 12:00:00 AM
Abstract :
An O(n3) algorithm is given for determining the most likely set of faulty processors in a class of systems introduced by Maheshwari and Hakimi[6], known as probabilistically diagnosable systems. The technique uses the a priori probability of failure of each unit combined with the results of tests which the processors administer to one another to perform diagnosis. The algorithm uses well-known results on network flow and minimum weight vertex cover sets.
Keywords :
Diagnosis; fault tolerance; multiprocessor systems; probabilistic diagnosability; vertex cover set; Assembly; Distributed computing; Fault diagnosis; Fault tolerant systems; Multiprocessing systems; Performance evaluation; Sufficient conditions; System testing; Diagnosis; fault tolerance; multiprocessor systems; probabilistic diagnosability; vertex cover set;
Journal_Title :
Computers, IEEE Transactions on
DOI :
10.1109/TC.1986.1676769
