This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Efficient Diagnosis of Multiprocessor Systems Under Probabilistic Models
September 1992 (vol. 41 no. 9)
pp. 1126-1136

The problem of fault diagnosis in multiprocessor systems is considered under a probabilistic fault model. The focus is on minimizing the number of tests that must be conducted to correctly diagnose the state of every processor in the system with high probability. A diagnosis algorithm that can correctly diagnose these states with probability approaching one in a class of systems performing slightly greater than a linear number of tests is presented. A nearly matching lower bound on the number of tests required to achieve correct diagnosis in arbitrary systems is proved. Lower and upper bounds on the number of tests required for regular systems are presented. A class of regular systems which includes hypercubes is shown to be correctly diagnosable with high probability. In all cases, the number of tests required under this probabilistic model is shown to be significantly less than under a bounded-size fault set model. These results represent a very great improvement in the performance of system-level diagnosis techniques.

[1] D. Angluin and L. Valiant, "Fast probabilistic algorithms for Hamiltonian circuits and matchings,"J. Comput. Syst. Sci., vol. 18, pp. 155-193, Apr. 1979.
[2] D.M. Blough, "Fault detection and diagnosis in multiprocessor systems," Ph.D. dissertation, The Johns Hopkins Univ., Baltimore, MD, 1988.
[3] 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.
[4] M. Blount, "Probabilistic treatment of diagnosis in digital systems," inDig. 7th Int. Symp. Fault-Tolerant Comput., IEEE Computer Society Press, 1977, pp. 72-77.
[5] H. Chernoff, "A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations,"Ann. Math. Stat., vol. 23, pp. 493-507, 1952.
[6] A. T. Dahbura, "An efficient algorithm for identifying the most likely fault set in a probabilistically diagnosable system,"IEEE Trans. Comput., vol. C-35, pp. 354-356, Apr. 1986.
[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] P. Erdös and P. Spencer,Probabilistic Methods in Combinatorics. New York: Academic, 1974.
[9] W. Feller,An Introduction to Probability Theory and its Applications, New York: Wiley, 1968.
[10] S. L. Hakimi and A. T. Amin, "Characterization of the connection assignment of diagnosable systems,"IEEE Trans. Comput., vol. C-23, pp. 86-88, Jan. 1974.
[11] W. D. Hillis,The Connection Machine. Cambridge, MA: MIT Press, 1985.
[12] J. G. Kuhl and S. M. Reddy, "Distributed fault-tolerance for large multiprocessor system," inProc. 1980 Comput. Architecture Conf., France, May 1980.
[13] 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.
[14] S. Mallela and G. M. Masson, "Diagnosis without repair for hybrid fault situations,"IEEE Trans. Comput., vol. C-29, pp. 461-470, June 1980.
[15] A. Pelc, "Undirected graph models for system-level fault diagnosis," Département d'Informatique Research Report #10, Universitédu QuébecàHull, 1988.
[16] F. Preparata, G. Metze, and R. Chien, "On the connection assignment problem of diagnosable systems,"IEEE Trans. Electron. Comput., vol. EC-16, pp. 848-854, Dec. 1967.
[17] 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.
[18] E. Scheinerman, "Almost sure fault tolerance in random graphs,"SIAM J. Comput., vol. 16, pp. 1124-1134, Dec. 1987.
[19] A. K. Somani, V. K. Agrawal, and D. Avis, "A generalized theory for system level diagnosis,"IEEE Trans. Comput., vol. C-36, pp. 538-546, May 1987.
[20] G. F. Sullivan, "System-level fault diagnosability in probabilistic and weighted models," inDig. 17th Int. Symp. Fault-Tolerant Comput., IEEE Computer Society Press, 1987, pp. 190-195.
[21] C. L. Yang and G. M. Masson, "A fault identification algorithm forti,- diagnosable systems,"IEEE Trans. Comput., vol. C-35, pp. 503-510, June 1986.

Index Terms:
multiprocessor systems; fault diagnosis; probabilistic fault model; diagnosis algorithm; lower bound; upper bounds; hypercubes; computational complexity; fault tolerant computing; hypercube networks; multiprocessing systems; parallel algorithms; probability.
Citation:
D.M. Blough, G.F. Sullivan, G.M. Masson, "Efficient Diagnosis of Multiprocessor Systems Under Probabilistic Models," IEEE Transactions on Computers, vol. 41, no. 9, pp. 1126-1136, Sept. 1992, doi:10.1109/12.165394
Usage of this product signifies your acceptance of the Terms of Use.