This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Diagnosing Arbitrarily Connected Parallel Computers with High Probability
May 1992 (vol. 41 no. 5)
pp. 606-615

A practical model for probabilistic fault diagnosis is presented. Unlike PMC-based models, the model allows testers to conduct multiple tests on the same processor. This allows the design of efficient probabilistic diagnosis algorithms with good asymptotic behavior, with minimal constraints on the connection structure of the multiprocessor system, in contrast to other deterministic and probabilistic approaches. In practical cases, the number of immediate neighbors of any processor need be no greater than two, which implies that the algorithm can be applied to any practical homogeneous parallel architecture. It is also shown how to make efficient use of tests by allowing the number of testing processors, and the number of tests performed by a processor to be traded off in achieving asymptotically accurate diagnosis.

[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, "Fault detection and diagnosis in multiprocessor systems," Ph.D. dissertation, The Johns Hopkins Univ., Baltimore, MD, 1988.
[3] H. Chernoff, "A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations,"Ann. Math. Statist., vol. 23, pp. 493-507, 1952.
[4] 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.
[5] D. Fussell and S. Rangarajan, "Probabilistic diagnosis of multiprocessor systems with arbitrary connectivity," inProc. 19th Int. Symp. Fault Tolerant Comput., 1989, pp. 560-565.
[6] S. L. Hakimi and A. T. Amin, "Characterization of the connection assignment of diagnosable systems,"IEEE Trans. Comput., pp. 86-88, Jan. 1974.
[7] S. L. Hakimi and K. Y. Chwa, "Schemes for fault tolerant computing: A comparison of modularly redundant and t-diagnosable systems,"Inform. Contr., vol. 49, pp. 212-238, June 1981.
[8] J. Maeng and M. Malek, "A comparison connection assignment for self diagnosis of multiprocessor systems," inProc. 11th Int. Conf. Fault Tolerant Comput., June 1981, pp. 173-175.
[9] S. N. Maheshwari and S. L. Hakimi, "On models for diagnosable systems and probabilistic fault diagnosis,"IEEE Trans. Comput., pp. 228-236, Mar. 1976.
[10] F. P. Preparata, G. Metze, and R. T. Chien, "On the connection assignment problem of diagnosable systems,"IEEE Trans. Electron. Comput., vol. EC-16, pp. 848-854, Dec. 1967.
[11] S. Rangarajan, "Cooperative decision based fault diagnosis," Ph.D. dissertation, Dep. Comput. Sci., Univ. Texas at Austin, Dec. 1990.
[12] 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.
[13] S. Rangarajan and D. Fussell, "Probabilistic diagnosis algorithms tailored to system topology," inProc. 21st Int. Symp. Fault Tolerant Comput., June 1991, pp. 230-237.
[14] E. Scheinerman, "Almost sure fault tolerance in random graphs,"SIAM J. Comput., vol. 16, pp. 1124-1134, Dec. 1987.
[15] J. E. Smith, "Universal system diagnosis algorithms,"IEEE Trans. Comput., pp. 374-378, May 1979.

Index Terms:
parallel computers; probabilistic fault diagnosis; multiple tests; probabilistic diagnosis algorithms; asymptotic behavior; multiprocessor system; immediate neighbors; homogeneous parallel architecture; testing processors; fault tolerant computing; parallel algorithms; parallel architectures; parallel machines; probability.
Citation:
S. Rangarajan, D. Fussell, "Diagnosing Arbitrarily Connected Parallel Computers with High Probability," IEEE Transactions on Computers, vol. 41, no. 5, pp. 606-615, May 1992, doi:10.1109/12.142687
Usage of this product signifies your acceptance of the Terms of Use.