Issue No.03 - March (1992 vol.41)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.127443
<p>The authors consider a comparison-based probabilistic model for multiprocessor fault diagnosis. They study the problem of optimal diagnosis, which is to correctly identify the status (faulty/fault-free) of units in the system, with maximum probability. For some parameter values, this probabilistic model is well approximated by the asymmetric comparison model introduced by M. Malek (1980). For arbitrary systems it is shown that optimal diagnosis in the probabilistic model and in Malek's model is NP-hard. However, the authors construct efficient diagnosis algorithms in the asymmetric comparison model for a class of systems corresponding to bipartite graphs which includes hypercubes, grids, and forests. Furthermore, for ring systems, a linear-time algorithm to perform optimal diagnosis in the probabilistic model is presented.</p>
ault diagnosis; comparison models; comparison-based probabilistic model; multiprocessor; optimal diagnosis; asymmetric comparison model; NP-hard; bipartite graphs; hypercubes; grids; forests; ring systems; linear-time algorithm; computational complexity; fault location; fault tolerant computing; multiprocessing systems.
D.M. Blough, A. Pelc, "Complexity of Fault Diagnosis in Comparison Models", IEEE Transactions on Computers, vol.41, no. 3, pp. 318-324, March 1992, doi:10.1109/12.127443