This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A.T. Dahbura, AT&T Bell Laboratories
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 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
Usage of this product signifies your acceptance of the Terms of Use.