This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Complexity of Fault Diagnosis in Comparison Models
March 1992 (vol. 41 no. 3)
pp. 318-324

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.

[1] D.M. Blough, G.F. Sullivan, and G.M. Masson, "Almost certain diagnosis for intermittently faulty systems," inProc. 18th Int. Symp. Fault-Tolerant Comput., 1988, pp. 260-271.
[2] D. M. Blough, G. F. Sullivan, and G. M. Masson, "Fault diagnosis for sparsely interconnected multiprocessor systems," inProc. 19th Symp. Fault-Tolerant Comput., June 1989, pp. 62-69.
[3] M. L. Blount, "Probabilistic treatment of diagnosis in digital systems," inDig. Papers, FTCS-7, 1977, pp. 72-77.
[4] J. A. Bondy and U. S. R. Murty,Graph Theory with Applications. New York: Elsevier North Holland, 1976.
[5] K. Y. Chwa and S. L. Hakimi, "Schemes for fault-tolerant computing: A comparison of modularly redundant and t-diagnosable systems,"Inform. Contr., vol. 49, pp. 212-238, 1981.
[6] A. Dahbura, K. K. Sabnani, and L. L. King, "The comparison approach to multiprocessors fault diagnosis,"IEEE Trans. Comput., vol. C-36, pp. 373-378, Mar. 1987.
[7] H. Fujiwara and K. Kinoshita, "Connection assignments for probabilistically diagnosable systems,"IEEE Trans. Comput., vol. C-27, pp. 280-283, Mar. 1978.
[8] H. Fujiwara and K. Kinoshita, "On the computational complexity of system diagnosis,"IEEE Trans. Comput., vol. C-27, pp. 881-885, Oct. 1978.
[9] M. R. Garey and D. S. Johnson,Computers and Intractability: A Guide to Theory of NP-Completeness. San Francisco, CA: Freeman, 1979.
[10] J. Hopcroft and R. Karp, "An n2.5algorithm for maximum matchings in bipartite graphs,"SIAM. J. Comput., vol. 2, pp. 225-231, Dec. 1973.
[11] S. N. Maheshwari and S. L. Hakimi, "On models for diagnosable systems and probabilistic fault diagnosis,"IEEE Trans. Comput., vol. C-25, pp. 228-236, Mar. 1976.
[12] M. Malek, "A comparison connection assignment for diagnosis of multiprocessor systems," inProc. 7th Symp. Comput. Architecture, May 1980, pp. 31-35.
[13] A. Pelc, "Undirected graph models for system-level fault diagnosis,"IEEE Trans. Comput., vol. 40, pp. 1271-1276, Nov. 1991.
[14] F. P. Preparata, G. Metze, and R. T. Chien, "On the connection assignment problem of diagnosable systems,"IEEE Trans. Electron. Comput., vol. C-16, pp. 848-854, Dec. 1967.
[15] S. Rangarajan and D. Fussell, "A probabilistic method for fault diagnosis of multiprocessor systems," inProc. 18th Int. Symp. Fault-Tolerant Comput., 1988, pp. 278-283.

Index Terms:
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.
Citation:
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
Usage of this product signifies your acceptance of the Terms of Use.