This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Undirected Graph Models for System-Level Fault Diagnosis
November 1991 (vol. 40 no. 11)
pp. 1271-1276

The author considers two comparison-based diagnosis models previously introduced by K.Y. Chwa et al. (1981) and M. Malek (1980). For each of them, classical t-diagnosability and probabilistic diagnosability based on the maximum likelihood principle are discussed, probabilistic model for comparison testing is introduced. In all considered models, optimal diagnosable systems, i.e., those which use the least possible number of testing links, are designed. These systems have a linear number of links and can be diagnosed in linear time. It is proved, however, that for general systems, both diagnosis and diagnosability problems are NP-hard. The model is used for fault diagnosis of multiprocessor systems.

[1] F. Barsi, "Probabilistic syndrome decoding in self-diagnosable digital systems,"Digital Processes, vol. 7, pp. 33-46, 1981.
[2] F. Barsi, F. Grandoni, and P. Maestrini, "A theory of diagnosability of digital systems,"IEEE Trans. Comput., vol. C-25, pp. 585-593, June 1976.
[3] D.M. Blough, "Fault detection and diagnosis in multiprocessor systems," Ph.D. dissertation, The Johns Hopkins Univ., Baltimore, MD, 1988.
[4] 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.
[5] M. L. Blount, "Probabilistic treatment of diagnosis in digital systems," inProc. 7th Int. Symp. Fault-Tolerant Comput., 1977, pp. 72-77.
[6] 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.
[7] 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.
[8] A. Das, K. B. Lakshmanan, K. Thulasiraman, and V. K. Agarwal, "Generalized characterization of diagnosable systems, based on Kohda's theorem," inProc. 1987 Conf. Inform. Sci. Syst., Baltimore, MD, Mar. 1987, pp. 220-225.
[9] M. R. Garey and D. S. Johnson,Computers and Intractability: A Guide to Theory of NP-Completeness. San Francisco, CA: Freeman, 1979.
[10] S. L. Hakimi and A. T. Amin, "Characterization of connection assignment of diagnosable systems,"IEEE Trans. Comput., vol. C-23, pp. 86-88, Jan. 1974.
[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] 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.
[14] 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.
[15] N. D. A. Sengupta, S. Bandyopadhyay, and P. K. Srimani, "A new method to test system diagnosability,"Inform. Sci., vol. 22, pp. 131- 138, 1980.
[16] L. Simoncini and A. D. Friedman, "Incomplete fault coverage in modular multiprocessor systems," inProc. ACM Annu. Conf., 1978, pp. 210-216.

Index Terms:
unidirected graph models; multiprocessor systems; system-level fault diagnosis; comparison-based diagnosis models; classical t-diagnosability; probabilistic diagnosability; maximum likelihood principle; comparison testing; optimal diagnosable systems; NP-hard; fault tolerant computing; graph theory; multiprocessing systems.
Citation:
A. Pelc, "Undirected Graph Models for System-Level Fault Diagnosis," IEEE Transactions on Computers, vol. 40, no. 11, pp. 1271-1276, Nov. 1991, doi:10.1109/12.102832
Usage of this product signifies your acceptance of the Terms of Use.