
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
A. Sengupta, A.T. Dahbura, "On SelfDiagnosable Multiprocessor Systems: Diagnosis by the Comparison Approach," IEEE Transactions on Computers, vol. 41, no. 11, pp. 13861396, November, 1992.  
BibTex  x  
@article{ 10.1109/12.177309, author = {A. Sengupta and A.T. Dahbura}, title = {On SelfDiagnosable Multiprocessor Systems: Diagnosis by the Comparison Approach}, journal ={IEEE Transactions on Computers}, volume = {41}, number = {11}, issn = {00189340}, year = {1992}, pages = {13861396}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.177309}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  On SelfDiagnosable Multiprocessor Systems: Diagnosis by the Comparison Approach IS  11 SN  00189340 SP1386 EP1396 EPD  13861396 A1  A. Sengupta, A1  A.T. Dahbura, PY  1992 KW  selfdiagnosable multiprocessor systems; faulty processors; polynomialtime algorithm; fault tolerant computing; multiprocessing systems. VL  41 JA  IEEE Transactions on Computers ER   
The diagnosability and diagnosis problems for a model introduced by J. Maeng and M. Malek (1981) of a selfdiagnosable 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 polynomialtime 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. 3135.
[2] J. Maeng and M. Malek, "A comparison connection assignment for selfdiagnosis of multiprocessor systems," inProc. 11th Int. Symp. FaultTolerant Comput., 1981, pp. 173175.
[3] S. L. Hakimi and K.Y. Chwa, "Schemes for fault tolerant computing: A comparison of modularly redundant andtdiagnosable systems,"Inform. Contr., vol. 49, pp. 212238, June 1981.
[4] F. P. Preparata, G. Metze, and R. T. Chien, "On the connection assignment problem of diagnosable systems,"IEEE Trans. Comput., vol. EC16, pp. 448454, Dec. 1967.
[5] S. Mallela and G. M. Masson, "Diagnosable systems for intermittent faults,"IEEE Trans. Comput., vol. C27, pp. 560566, June 1978.
[6] S. Mallela and G. M. Masson, "Diagnosis without repair for hybrid fault situations,"IEEE Trans. Comput., vol. C29, pp. 461470, June 1980.
[7] S. N. Maheshwari and S. L. Hakimi, "On models of diagnosable systems and probabilistic fault diagnosis,"IEEE Trans. Comput., vol. C25, pp. 228236, Mar. 1976.
[8] F. Barsi, F. Grandoni, and P. Maestrini, "A theory of diagnosability of digital systems,"IEEE Trans. Comput., vol. C25, pp. 585593, June 1976.
[9] C. R. Kime, "An analysis model for digital system diagnosis,"IEEE Trans. Comput., vol. C19, pp. 10631073, Nov. 1970.
[10] J. D. Russell and C. R. Kime, "System fault diagnosis: Closure and diagnosability with repair,"IEEE Trans. Comput., vol. C24, pp. 10781088, Nov. 1975.
[11] S. Karunanithi and A. D. Friedman, "Analysis of digital systems using a new measure of system diagnosis,"IEEE Trans. Comput., vol. C28, pp. 121133, Feb. 1979.
[12] A. Sengupta and A. Sen, "On the diagnosability problem for a general model of diagnosable systems,"Inform. Sci., vol. 42, pp. 8394, 1987.
[13] G. G. L. Meyer and G. M. Masson, "An efficient fault diagnosis algorithm for symmetric multiple processor architectures,"IEEE Trans. Comput., vol. C27, pp. 10591063, Nov. 1978.
[14] G. G. L. Meyer, "A fault diagnosis algorithm for asymmetric modular architecture,"IEEE Trans. Comput., vol. C30, pp. 8083, Jan. 1981.
[15] A. T. Dahbura and G. M. Masson, "AnO(n2.5) fault identification algorithm for diagnosable systems,"IEEE Trans. Comput., vol. C33, pp. 486492, June 1984.
[16] A. T. Dahbura and G. M. Masson, "A practical variation of theO(n2.5) fault diagnosis algorithm," inProc. 1984 Int. Symp. FaultTolerant Comput., June 1984, pp. 428433.
[17] A. T. Dahbura, G. M. Masson, and C.L. Yang, "Selfimplicating structures for diagnosable systems,"IEEE Trans. Comput., vol. C34, pp. 718723, Aug. 1985.
[18] A. Dahbura, K. K. Sabnani, and L. L. King, "The comparison approach to multiprocessors fault diagnosis,"IEEE Trans. Comput., vol. C36, pp. 373378, Mar. 1987.
[19] T. Kameda, S. Toida, and F. J. Allan, "A diagnosis algorithm for networks,"Inform. Contr., vol. 29, pp. 141148, 1975.
[20] J. T. Butler, "Diagnosis of intermittently faulty and permanently faulty processors in a multiprocessing system using threevalued functions," inProc. 12th Int. Symp. Multiple Valued Logic, May 1982, pp. 122128.
[21] A. Sengupta and A. Sen, "On the diagnosability of a general model of systems with threevalued test outcomes,"IEEE Trans. Comput., vol. C35, pp. 170173, 1986.
[22] S. L. Hakimi and A. T. Amin, "Characterization of the connection assignment of diagnosable systems,"IEEE Trans. Comput., vol. C23, pp. 8688, 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 NPCompleteness. San Francisco, CA: Freeman, 1979.
[25] C. Berge,Graphs and Hypergraphs. Amsterdam, The Netherlands: NorthHolland, 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. 1727.