The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.04 - April (1986 vol.35)
pp: 354-356
A.T. Dahbura , AT&T Bell Laboratories
ABSTRACT
An O(n<sup>3</sup>) 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 wel
INDEX TERMS
vertex cover set, Diagnosis, fault tolerance, multiprocessor systems, probabilistic diagnosability
CITATION
A.T. Dahbura, "An Efficient Algorithm for Identifying the Most Likely Fault Set in a Probabilistically Diagnosable System", IEEE Transactions on Computers, vol.35, no. 4, pp. 354-356, April 1986, doi:10.1109/TC.1986.1676769
22 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool