
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Sanjeev Khanna, W. Kent Fuchs, "A Graph Partitioning Approach to Sequential Diagnosis," IEEE Transactions on Computers, vol. 46, no. 1, pp. 3947, January, 1997.  
BibTex  x  
@article{ 10.1109/12.559801, author = {Sanjeev Khanna and W. Kent Fuchs}, title = {A Graph Partitioning Approach to Sequential Diagnosis}, journal ={IEEE Transactions on Computers}, volume = {46}, number = {1}, issn = {00189340}, year = {1997}, pages = {3947}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.559801}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  A Graph Partitioning Approach to Sequential Diagnosis IS  1 SN  00189340 SP39 EP47 EPD  3947 A1  Sanjeev Khanna, A1  W. Kent Fuchs, PY  1997 KW  Analysis of algorithms KW  degree of diagnosability KW  faulttolerance KW  graph partitioning KW  multiprocessor systems KW  sequential diagnosis KW  systemlevel diagnosis. VL  46 JA  IEEE Transactions on Computers ER   
Abstract—This paper describes a generalized sequential diagnosis algorithm whose analysis leads to strong diagnosability results for a variety of multiprocessor interconnection topologies. The overall complexity of this algorithm in terms of total testing and syndrome decoding time is linear in the number of edges in the interconnection graph and the total number of iterations of diagnosis and repair needed by the algorithm is bounded by the diameter of the interconnection graph. The degree of diagnosability of this algorithm for a given interconnection graph is shown to be directly related to a graph parameter which we refer to as the partition number. We approximate this graph parameter for several interconnection topologies and thereby obtain lower bounds on degree of diagnosability achieved by our algorithm on these topologies. If we let
[1] F.P. Preparata, G. Metze, and R.T. Chien, "On the Connection Assignment Problem of Diagnosable Systems," IEEE Trans. Electronic Computers, vol. 16, pp. 848854, Dec. 1967.
[2] A.D. Friedman and L. Simoncini, "SystemLevel Fault Diagnosis," Computer, vol. 13, no. 3, pp. 4753, Mar. 1980.
[3] C. Kime, "System Diagnosis," FaultTolerant Computing: Theory and Techniques, D.K. Pradhan, ed., vol. II, chapter 8. Englewood Cliffs, N.J.: Prentice Hall, 1986.
[4] A.K. Somani, V.K. Agarwal, and D. Avis, "A Generalized Theory for System Level Diagnosis," IEEE Trans. Computers, vol. 36, no. 5, pp. 538546, May 1987.
[5] A.T. Dahbura, "SystemLevel Diagnosis: A Perspective for the Third Decade," Concurrent Computation: Algorithms, Architectures, Technologies.New York: Plenum, 1988.
[6] S.L. Hakimi and A.T. Amin, "Characterization of Connection Assignment of Diagnosable Systems," IEEE Trans. Computers, vol. 23, no. 1, pp. 8688, Jan. 1974.
[7] J.R. Armstrong and F.G. Gray, "Fault Diagnosis in a Boolean nCube Array of Microprocessors," IEEE Trans. Computers, vol. 30, no. 8, pp. 587590, Aug. 1981.
[8] A.T. Dahbura and G.M. Masson, "AnO(n2.5) Fault Identification Algorithm for Diagnosable Systems," IEEE Trans. Computers, vol. 33, no. 6, pp. 485492, June 1984.
[9] S. Huang, J. Xu, and T. Chen, "Characterization and Design of Sequentially tDiagnosable Systems," Proc. IEEE CS 19th Int'l Symp. FaultTolerant Computing, pp. 554559, 1989.
[10] A. Kavianpour and K.H. Kim, "A Comparative Evaluation of Four Basic SystemLevel Diagnosis Strategies for Hypercubes," IEEE Trans. Reliability, vol. 41, pp. 2637, Mar. 1992.
[11] J.G. Kuhl and S.M. Reddy, "Distributed Fault Tolerance for Large Multiprocessor Systems," Proc. 1980 Computer ArchitectureSymp., pp. 222229, May 1980.
[12] S.H. Hosseini, J.G. Kuhl, and S.M. Reddy, "A Diagnosis Algorithm for Distributed Computing Systems with Dynamic Failure and Repair," IEEE Trans. Computers, vol. 33, no. 3, pp. 223233, Mar. 1984.
[13] A. Bagchi and S.L. Hakimi, "An Optimal Algorithm for Distributed System Level Diagnosis," Proc. IEEE CS 21st Int'l Symp. FaultTolerant Computing, pp. 214221, 1991.
[14] R. Bianchini Jr. and R. Buskens, "An Adaptive Distributed SystemLevel Diagnosis Algorithm and Its Implementation," Proc. 21st Int'l Symp. FaultTolerant Computing (FTCS21), pp. 222229, 1991.
[15] A. Bagchi, "A Distributed Algorithm for SystemLevel Diagnosis in Hypercubes," Proc. IEEE Workshop FaultTolerant Parallel and Distributed Systems, pp. 106113, July 1992.
[16] D.M. Blough, G.F. Sullivan, and G.M. Masson, "Almost Certain Diagnosis for Intermittently Faulty Systems," Proc. IEEE CS 18th Int'l Symp. FaultTolerant Computing, pp. 260265, 1988.
[17] D.M. Blough and A. Pelc, "Reliable Diagnosis and Repair in ConstantDegree Multiprocessor Systems," Proc. IEEE CS 20th Int'l Symp. FaultTolerant Computing, pp. 316323, 1990.
[18] S. Rangarajan and D. Fussell, "Probabilistic Diagnosis Algorithms Tailored to System Topology," Proc. IEEE CS 21st Int'l Symp. FaultTolerant Computing, pp. 230237, 1991.
[19] A. Ghafoor and P. Sole, "Performance of FaultTolerant Diagnostics in the Hypercube Systems," IEEE Trans. Computers, vol. 38, pp. 1,1641,172, Aug. 1989.
[20] S. Khanna and W.K. Fuchs, "New Algorithms for Sequential Diagnosis," Technical Report CRHC9213, Univ. of Illinois, Center for Reliable and HighPerformance Computing, Aug. 1992.
[21] F.P. Preparata and J. Vuillemin, “The CubeConnected Cycles: A Versatile Network for Parallel Computation,” Comm ACM, vol. 24, no. 5, pp. 300309, 1981.
[22] D.P. Bertsekas and J.N. Tsitsiklis, Parallel and Distributed Computation.Englewood Cliffs, N.J.: Prentice Hall International, 1989.