
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Y. Chen, W. Bücken, K. Echtle, "Efficient Algorithms for System Diagnosis with Both Processor and Comparator Faults," IEEE Transactions on Parallel and Distributed Systems, vol. 4, no. 4, pp. 371381, April, 1993.  
BibTex  x  
@article{ 10.1109/71.219748, author = {Y. Chen and W. Bücken and K. Echtle}, title = {Efficient Algorithms for System Diagnosis with Both Processor and Comparator Faults}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {4}, number = {4}, issn = {10459219}, year = {1993}, pages = {371381}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.219748}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  Efficient Algorithms for System Diagnosis with Both Processor and Comparator Faults IS  4 SN  10459219 SP371 EP381 EPD  371381 A1  Y. Chen, A1  W. Bücken, A1  K. Echtle, PY  1993 KW  Index Termsprocessor faults; system diagnosis; comparisonbased selfdiagnosis; multiprocessorsystems; comparator faults; O( mod E mod )/sup 2/ algorithm; computational complexity;fault tolerant computing; multiprocessing systems VL  4 JA  IEEE Transactions on Parallel and Distributed Systems ER   
For the comparisonbased selfdiagnosis of multiprocessor systems, an extended modelthat considers both processor and comparator faults is presented. It is shown that in thismodel the system diagnosability is t>or=Z delta /2Z, where delta is the minimum vertexdegree of the system graph. However, if the number of faulty comparators is assumednot to exceed the number of faulty processors, the diagnosability of the model reachest>or= delta . An optimal O( mod E mod ) algorithm, where E is the set of comparators, isgiven for identifying all faulty processors and comparators, provided that the total number of faulty components does not exceed the system diagnosability, and an O(mod E mod)/sup 2/ algorithm for the case t>or= delta is also presented. These efficient algorithms determine the faulty processors by calculating each processor's weight, which is mainly defined by the number of adjacent relative tests stating 'agreement'. After sorting the processors according to their weights, the algorithms determine all faulty components by separating the sorted processor list.
[1] F. P. Preparata, G. Metze, and R. T. Chien, "On the connection assignment problem of diagnosable systems,"IEEE Trans. Comput., vol. EC16, pp. 848854, Dec. 1967.
[2] M. Malek, "A comparison connection assignment for diagnosis of multiprocessor systems," inProc. 7th Symp. Comput. Architecture, May 1980, pp. 3135.
[3] S. L. Hakimi and K.Y. Chwa, "Schemes for fault tolerant computing: A comparison of modularity redundant and tdiagnosable systems,"Inform. Contr., vol. 49, pp. 212238, June 1981.
[4] E. Ammann and M. Dal Cin, "Efficient algorithms for comparisonbased selfdiagnosis," inProc. SelfDiagnosis and Fault Tolerance, 1982, pp. 118.
[5] C. L. Yang and G. M. Masson, "An efficient algorithm for multiprocessor fault diagnosis using the comparison approach," inDig. Papers 16th Int. Symp. FaultTolerant Comput., 1986, pp. 238243.
[6] 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.
[7] J. Maeng and M. Malek, "A comparison connection assignment for diagnosis of multiprocessor systems," inDig. Papers 11th Int. Symp. FaultTolerant Comput., 1981, pp. 173175.
[8] A. Sengupta and A. T. Dahbura, "On selfdiagnosable multiprocessor systems: diagnosis by comparison approach," inDig. Papers 19th Int. Symp. FaultTolerant Comput., 1989, pp. 5461.
[9] K. Echtle, "Fault diagnosis by combination of absolute and relative tests," inProc. 1st Euro. Workshop Dependable Comput., Mar. 1989.
[10] M. Dal Cin, "On distributed systemlevel selfdiagnosis," inProc. 4th Int. Conf. FaultTolerant Comput., Informatik Fachberichte214, SpringerVerlag, Heidelberg, Sept. 1989, pp. 186196.
[11] Y. Chen and T. Chen, "Implementing faulttolerance via modular redundancy with comparison,"IEEE Trans. Reliability, vol. 39, no. 2, pp. 217225, June 1990.
[12] A. K. Somani, V. K. Agrawal, and D. Avis, "A generalized theory for system level diagnosis,"IEEE Trans. Comput., vol. C36, pp. 538546, May 1987.
[13] P. T. DeSousa and F. P. Mathur, "Siftout modular redundancy,"IEEE Trans. Comput., C27, pp. 624627, July 1978.
[14] H. Ihara, K. Fukuoka, Y. Kubo, and S. Yokota, "Faulttolerant computer system with three symmetric computers,"Proc. IEEE, vol. 66, pp. 11601177, Oct. 1978.
[15] J. Losq, "A high efficient redundancy scheme: Selfpurging redundancy,"IEEE Trans. Comput., vol. C25, pp. 569578, June 1976.
[16] E. Ammann, R. Brause, M. Dal Cin, E. Dilger, J. Lutz, and T. Risse, "ATTEMPTO: A faulttolerant multiprocessor working station; design and concepts," inDig. Papers 13th Int. Symp. FaultTolerant Comput., 1983, pp. 1013.