This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
On Self-Diagnosable Multiprocessor Systems: Diagnosis by the Comparison Approach
November 1992 (vol. 41 no. 11)
pp. 1386-1396

The diagnosability and diagnosis problems for a model introduced by J. Maeng and M. Malek (1981) of a self-diagnosable multiprocessor system where processors compare the results of tasks performed by other processors in the system are analyzed. A set of criteria is given for determining whether the faulty processors in the system can be diagnosed on the basis of the comparisons, and a polynomial-time algorithm is presented to identify the faulty units of such a system on the basis of the comparison results when the system is known to be diagnosable.

[1] M. Malek, "A comparison connection assignment for diagnosis of multiprocessor systems," inProc. 7th Symp. Comput. Architecture, May 1980, pp. 31-35.
[2] J. Maeng and M. Malek, "A comparison connection assignment for self-diagnosis of multiprocessor systems," inProc. 11th Int. Symp. Fault-Tolerant Comput., 1981, pp. 173-175.
[3] S. L. Hakimi and K.-Y. Chwa, "Schemes for fault tolerant computing: A comparison of modularly redundant andt-diagnosable systems,"Inform. Contr., vol. 49, pp. 212-238, June 1981.
[4] F. P. Preparata, G. Metze, and R. T. Chien, "On the connection assignment problem of diagnosable systems,"IEEE Trans. Comput., vol. EC-16, pp. 448-454, Dec. 1967.
[5] S. Mallela and G. M. Masson, "Diagnosable systems for intermittent faults,"IEEE Trans. Comput., vol. C-27, pp. 560-566, June 1978.
[6] S. Mallela and G. M. Masson, "Diagnosis without repair for hybrid fault situations,"IEEE Trans. Comput., vol. C-29, pp. 461-470, June 1980.
[7] S. N. Maheshwari and S. L. Hakimi, "On models of diagnosable systems and probabilistic fault diagnosis,"IEEE Trans. Comput., vol. C-25, pp. 228-236, Mar. 1976.
[8] 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.
[9] C. R. Kime, "An analysis model for digital system diagnosis,"IEEE Trans. Comput., vol. C-19, pp. 1063-1073, Nov. 1970.
[10] J. D. Russell and C. R. Kime, "System fault diagnosis: Closure and diagnosability with repair,"IEEE Trans. Comput., vol. C-24, pp. 1078-1088, Nov. 1975.
[11] S. Karunanithi and A. D. Friedman, "Analysis of digital systems using a new measure of system diagnosis,"IEEE Trans. Comput., vol. C-28, pp. 121-133, Feb. 1979.
[12] A. Sengupta and A. Sen, "On the diagnosability problem for a general model of diagnosable systems,"Inform. Sci., vol. 42, pp. 83-94, 1987.
[13] G. G. L. Meyer and G. M. Masson, "An efficient fault diagnosis algorithm for symmetric multiple processor architectures,"IEEE Trans. Comput., vol. C-27, pp. 1059-1063, Nov. 1978.
[14] G. G. L. Meyer, "A fault diagnosis algorithm for asymmetric modular architecture,"IEEE Trans. Comput., vol. C-30, pp. 80-83, Jan. 1981.
[15] A. T. Dahbura and G. M. Masson, "AnO(n2.5) fault identification algorithm for diagnosable systems,"IEEE Trans. Comput., vol. C-33, pp. 486-492, June 1984.
[16] A. T. Dahbura and G. M. Masson, "A practical variation of theO(n2.5) fault diagnosis algorithm," inProc. 1984 Int. Symp. Fault-Tolerant Comput., June 1984, pp. 428-433.
[17] A. T. Dahbura, G. M. Masson, and C.-L. Yang, "Self-implicating structures for diagnosable systems,"IEEE Trans. Comput., vol. C-34, pp. 718-723, Aug. 1985.
[18] 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.
[19] T. Kameda, S. Toida, and F. J. Allan, "A diagnosis algorithm for networks,"Inform. Contr., vol. 29, pp. 141-148, 1975.
[20] J. T. Butler, "Diagnosis of intermittently faulty and permanently faulty processors in a multiprocessing system using three-valued functions," inProc. 12th Int. Symp. Multiple Valued Logic, May 1982, pp. 122-128.
[21] A. Sengupta and A. Sen, "On the diagnosability of a general model of systems with three-valued test outcomes,"IEEE Trans. Comput., vol. C-35, pp. 170-173, 1986.
[22] 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.
[23] J. A. Bondy and U. S. R. Murty,Graph Theory with Applications. New York: Elsevier North Holland, 1976.
[24] M. R. Garey and D. S. Johnson,Computers and Intractability: A Guide to Theory of NP-Completeness. San Francisco, CA: Freeman, 1979.
[25] C. Berge,Graphs and Hypergraphs. Amsterdam, The Netherlands: North-Holland, 1973.
[26] S. Micali and V. V. Vazirani, An O(√∣V∣∣E∣) algorithm for maximum matching in general graphs, in Proc. 16th Annu. Symp. Foundations of Comput. Sci., Oct. 1980, pp. 17-27.

Index Terms:
self-diagnosable multiprocessor systems; faulty processors; polynomial-time algorithm; fault tolerant computing; multiprocessing systems.
Citation:
A. Sengupta, A.T. Dahbura, "On Self-Diagnosable Multiprocessor Systems: Diagnosis by the Comparison Approach," IEEE Transactions on Computers, vol. 41, no. 11, pp. 1386-1396, Nov. 1992, doi:10.1109/12.177309
Usage of this product signifies your acceptance of the Terms of Use.