
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Antonio Caruso, Stefano Chessa, Piero Maestrini, Paolo Santi, "Evaluation of a Diagnosis Algorithm for Regular Structures," IEEE Transactions on Computers, vol. 51, no. 7, pp. 850865, July, 2002.  
BibTex  x  
@article{ 10.1109/TC.2002.1017704, author = {Antonio Caruso and Stefano Chessa and Piero Maestrini and Paolo Santi}, title = {Evaluation of a Diagnosis Algorithm for Regular Structures}, journal ={IEEE Transactions on Computers}, volume = {51}, number = {7}, issn = {00189340}, year = {2002}, pages = {850865}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2002.1017704}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Evaluation of a Diagnosis Algorithm for Regular Structures IS  7 SN  00189340 SP850 EP865 EPD  850865 A1  Antonio Caruso, A1  Stefano Chessa, A1  Piero Maestrini, A1  Paolo Santi, PY  2002 KW  Fault tolerance KW  systemlevel diagnosis KW  PMC model KW  multiprocessor systems KW  waferscale testing. VL  51 JA  IEEE Transactions on Computers ER   
The problem of identifying the faulty units in regularly interconnected systems is addressed. The diagnosis is based on mutual tests of units, which are adjacent in the "system graph" describing the interconnection structure. This paper evaluates an algorithm named EDARS (Efficient Diagnosis Algorithm for Regular Structures). The diagnosis provided by this algorithm is provably correct and almost complete with high probability. Diagnosis correctness is guaranteed if the cardinality of the actual fault set is below a "syndromedependent bound," asserted by the algorithm itself along with the diagnosis. Evaluation of EDARS relies upon extensive simulation which covered grids, hypercubes, and cubeconnected cycles (CCC). Simulation experiments showed that the degree of the system graph has a strong impact over diagnosis completeness and affects the "syndromedependent bound," ensuring correctness. Furthermore, a comparative analysis of the performance of EDARS, with hypercubes and CCCs on one side and grids of the same size and degree on the other side, showed that diameter and bisection width of the system graph also influence the diagnosis correctness and completeness.
[1] F. Barsi, F. Grandoni, and P. Maestrini, “A Theory of Diagnosability of Digital Systems,” IEEE Trans. Computers, vol. 25, no. 6, pp. 585593, June 1976.
[2] D.M. Blough, G.F. Sullivan, and G.M. Masson, "Efficient Diagnosis of Multiprocessor Systems Under Probabilistic Models," IEEE Trans. Computers, vol. 41, pp. 1,1261,136, 1992.
[3] A. Caruso, S. Chessa, P. Maestrini, and P. Santi, “Diagnosis of Regular Structures,” Proc. DSN 2000–Dependable System and Networks, pp. 213222, June 2000.
[4] A. Caruso, S. Chessa, P. Maestrini, and P. Santi, “Fault Diagnosis of Grid Structures,” Theoretical Computer Science, to appear.
[5] S. Chessa, “SelfDiagnosis of GridInterconnected Systems with Applications to SelfTest of VLSI Wafers,” PhD Thesis TD2/99, Dept. of Computer Science, Univ. of Pisa, Italy, Mar. 1999.
[6] S. Chessa and P. Maestrini, “Correct and Almost Complete Diagnosis of Processors Grids,” Technical Report 1999B4.135, Istituto di Elaborazione dell'Informazione del CNR, Pisa, Italia, May 1999.
[7] T.H. Cormen,C.E. Leiserson, and R.L. Rivest,Introduction to Algorithms.Cambridge, Mass.: MIT Press/McGrawHill, 1990.
[8] A.T. Dahbura and G.M. Masson, “An$\big. O(n^{2.5})\bigr.$Fault Identification Algorithm for Diagnosable Systems,” IEEE Trans. Computers, vol. 33 no. 6, pp. 486492, June 1984.
[9] S.L. Hakimi and S.L. Amin, “Characterization of Connection Assignment of Diagnosable Systems,” IEEE Trans. Computers, vol. 23, no. 1, pp. 8688, Jan. 1974.
[10] K. Huang, V.K. Agarwal, L. LaForge, and K. Thulasiraman, “A Diagnosis Algorithm for Constant Degree Structures and Its Application to VLSI Circuit Testing,” IEEE Trans. Parallel and Distributed Systems, vol. 6, no. 4, pp. 363372, Apr. 1995.
[11] S. Khanna and W.K. Fuchs, A Graph Partitioning Approach to Sequential Diagnosis IEEE Trans. Computers, vol. 46, no. 1, pp. 3947, Jan. 1997.
[12] L.E. LaForge, K. Huang, and V.K. Agarwal, "Almost Sure Diagnosis of Almost Every Good Element," IEEE Trans. Computers, vol. 43, pp. 295305, 1994.
[13] A. Law and W. Kelton, Simulation Modeling and Analysis,New York: McGrawHill, 1991.
[14] J. Maeng and M. Malek, “A Comparison Connection Assignment for SelfDiagnosis of Multicomputer Systems,” Proc. FaultTolerant Computing Symp. (FTCS11), pp. 173175, June 1981.
[15] P. Maestrini and P. Santi, “SelfDiagnosis of Processor Arrays Using a Comparison Model,” Proc. Symp. Reliable and Distributed Systems (SRDS14), pp. 218228, Sept. 1995.
[16] F.P. Preparata, G. Metze, and R.T. Chien, “On the Connection Assignment Problem of Diagnosable Systems,” IEEE Trans. Computers, vol. 16, pp. 848854, Dec. 1967.
[17] S. Rangarajan, D. Fussel, and M. Malek, “BuiltIn Testing of Integrated Circuit Wafers,” IEEE Trans. Computers, vol. 39, no. 2, pp. 195205, Feb. 1990.
[18] P. Santi, “Evaluation of a SelfDiagnosis Algorithm for Regular Structures,” PhD thesis, Dept. of Computer Science, Univ. of Pisa, Italy, Nov. 1999.
[19] A.K. Somani and V.K. Agarwal, "Distributed Diagnosis Algorithms for Regular Interconnected Structures," IEEE Trans. Computers, vol. 41, no. 7, pp. 899906, July 1992.
[20] E. Scheinerman, "Almost Sure FaultTolerance in Random Graphs," SIAM J. Computing, vol. 16, pp. 1,1241,134, 1987.