Publication 2007 Issue No. 12 - December Abstract - Efficient Fault Identification of Diagnosable Systems under the Comparison Model
Efficient Fault Identification of Diagnosable Systems under the Comparison Model
December 2007 (vol. 56 no. 12)
pp. 1612-1618
 ASCII Text x Xiaofan Yang, Yuan Yan Tang, "Efficient Fault Identification of Diagnosable Systems under the Comparison Model," IEEE Transactions on Computers, vol. 56, no. 12, pp. 1612-1618, December, 2007.
 BibTex x @article{ 10.1109/TC.2007.70769,author = {Xiaofan Yang and Yuan Yan Tang},title = {Efficient Fault Identification of Diagnosable Systems under the Comparison Model},journal ={IEEE Transactions on Computers},volume = {56},number = {12},issn = {0018-9340},year = {2007},pages = {1612-1618},doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2007.70769},publisher = {IEEE Computer Society},address = {Los Alamitos, CA, USA},}
 RefWorks Procite/RefMan/Endnote x TY - JOURJO - IEEE Transactions on ComputersTI - Efficient Fault Identification of Diagnosable Systems under the Comparison ModelIS - 12SN - 0018-9340SP1612EP1618EPD - 1612-1618A1 - Xiaofan Yang, A1 - Yuan Yan Tang, PY - 2007KW - MulticomputerKW - system-level diagnosisKW - comparison modelKW - PMC modelKW - diagnosable systemKW - diagnosis algorithmVL - 56JA - IEEE Transactions on ComputersER -
Diagnosis-by-comparison is a realistic approach to the fault diagnosis of massive multicomputers. This paper addresses the fault identification of diagnosable multicomputer systems under the MM* comparison model. We find that the fault location task can be reduced to that under the classical PMC* model. On this basis, we present an Ο(n?Δ3?δ) time diagnosis algorithm for an n-node MM* diagnosable system, where Δ and δ denote the maximum and minimum degrees of a node, respectively. The proposed algorithm is much more effi-cient than the fastest known diagnosis algorithm (which consumes Ο(n5) time) because realistic massive multi-computers are sparsely interconnected and hence Δ, δ « n.

[1] S. Abraham and K. Padmanabhan, “The Twisted Cube Topology for Multiprocessors: A Study of Network Asymmetry,” J. Parallel and Distributed Computing, vol. 13, no. 1, pp. 104-110, 1991.
[2] S.B. Akers and B. Krishnamurthy, “A Graph-Theoretic Model for Symmetric Interconnection Networks,” IEEE Trans. Computers, vol. 38, no. 4, pp. 555-566, Apr. 1989.
[3] G.Y. Chang, G.J. Chang, and G.H. Chen, “Diagnosabilities of Regular Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 16, no. 4, pp. 314-323, Apr. 2005.
[4] K.Y. Chwa and S.L. Hakimi, “Schemes for Fault Tolerant Computing: A Comparison of Modularly Redundant and $t$ -Diagnosable Systems,” Information and Control, vol. 49, no. 3, pp.212-238, 1981.
[5] K.Y. Chwa and S.L. Hakimi, “On Fault Identification in Diagnosable Systems,” IEEE Trans. Computers, vol. 30, no. 6, pp.414-422, June 1981.
[6] P. Cull and S.M. Larson, “The Möbius Cubes,” IEEE Trans. Computers, vol. 44, no. 5, pp. 647-659, May 1995.
[7] A.T. Dahbura and G.M. Masson, “An $O(n^{2.5})$ Fault Identification Algorithm for Diagnosable Systems,” IEEE Trans. Computers, vol. 3, no. 6, pp. 486-492, June 1984.
[8] R. Diestel, Graph Theory, third ed. Springer-Heidelberg, 2005.
[9] E.P. Duarte Jr. and T. Nanya, “A Hierarchical Adaptive Distributed System-Level Diagnosis Algorithm,” IEEE Trans. Computers, vol. 47, no. 1, pp. 34-45, Jan. 1998.
[10] K. Efe, “The Crossed Cube Architecture for Parallel Computation,” IEEE Trans. Parallel and Distributed Systems, vol. 3, no. 5, pp.513-524, Sept. 1992.
[11] J. Fan, “Diagnosability of Crossed Cubes under the Comparison Diagnosis Model,” IEEE Trans. Parallel and Distributed Systems, vol. 13, no. 7, pp. 687-692, July 2002.
[12] J. Fan and X. Lin, “The $t/k$ -Diagnosability of the BC Graphs,” IEEE Trans. Computers, vol. 54, no. 2, pp. 176-184, Feb. 2005.
[13] P.L. Lai, J.J.M. Tan, C.H. Tsai, and L.H. Hsu, “The Diagnosability of the Matching Composition Network under the Comparison Diagnosis Model,” IEEE Trans. Computers, vol. 53, no. 8, pp. 1064-1069, Aug. 2004.
[14] J. Maeng and M. Malek, “A Comparison Connection Assignment for Self-Diagnosis of Multiprocessor Systems,” Proc. 11th Int'l Symp. Fault-Tolerant Computing, pp. 173-175, 1981.
[15] M. Malek, “A Comparison Connection Assignment for Diagnosis of Multiprocessor Systems,” Proc. Seventh Int'l Symp. Computer Architecture, pp. 31-35, 1980.
[16] B. Parhami, An Introduction to Parallel Processing: Algorithms and Architectures. Plenum Press, 1999.
[17] M. Pease, R. Shostak, and L. Lamport, “Reaching Agreement in the Presence of Faults,” J. ACM, vol. 27, no. 2, pp. 228-234, 1980.
[18] F.P. Preparata, G. Metze, and R.T. Chien, “On the Connection Assignment Problem of Diagnosable Systems,” IEEE Trans. Computers, vol. 16, no. 12, pp. 448-454, Dec. 1967.
[19] A. Sengupta and A.T. Dahbura, “On Self-Diagnosable Multiprocessor Systems: Diagnosis by the Comparison Approach,” IEEE Trans. Computers, vol. 41, no. 11, pp. 1386-1396, Nov. 1992.
[20] A.K. Somani and O. Peleg, “On Diagnosability of Large Fault Sets in Regular Topology-Based Computer Systems,” IEEE Trans. Computers, vol. 45, no. 8, pp. 892-903, Aug. 1996.
[21] A. Subbiah and D.M. Blough, “Distributed Diagnosis in Dynamic Fault Environments,” IEEE Trans. Parallel and Distributed Systems, vol. 15, no. 5, pp. 453-467, May 2004.
[22] G. Sullivan, “An $O(t^{3}+ |E|)$ Fault Identification Algorithm for Diagnosable Systems,” IEEE Trans. Computers, vol. 37, no. 4, pp.388-397, Apr. 1988.
[23] D. Wang, “Diagnosability of Hypercubes and Enhanced Hypercubes under the Comparison Diagnosis Model,” IEEE Trans. Computers, vol. 48, no. 12, pp. 1369-1374, Dec. 1999.
[24] C.-L. Yang, G.M. Masson, and R.A. Leonetti, “On Fault Isolation and Identification in $t_{1}/t_{1}$ -Diagnosable Systems,” IEEE Trans. Computers, vol. 35, no. 6, pp. 639-643, June 1986.
[25] X. Yang, “A Linear Time Fault Diagnosis for Hypercube Multiprocessors under the ${\rm MM}^{\ast}$ Model,” Proc. 12th Asian Test Symp., pp.50-55, 2003.
[26] X. Yang, “A Fast Pessimistic One-Step Diagnosis Algorithm for Hypercube Multicomputer Systems,” J. Parallel Distributed Computing, vol. 64, no. 4, pp. 546-553, 2004.
[27] X. Yang, J. Cao, G.M. Megson, and J. Luo, “Minimum Neighborhood in a Generalized Cube,” Information Processing Letters, vol. 97, no. 3, pp. 88-93, 2006.
[28] X. Yang, D.J. Evans, and G.M. Megson, “The Locally Twisted Cubes,” Int'l J. Computer Math., vol. 82, no. 4, pp. 401-413, 2005.
[29] X. Yang, G.M. Megson, and D.J. Evans, “A Comparison-Based Diagnosis Algorithm Tailored for Crossed Cube Multiprocessor Systems,” Microprocessors and Microsystems, vol. 29, no. 4, pp. 169-175, 2005.
[30] X. Yang and Y.Y. Tang, “A $(4n - 9)/3$ Diagnosis Algorithm on $n$ -Dimensional Cube Network,” Information Sciences, vol. 177, no. 8, pp. 1771-1781, 2007.
[31] J. Zheng, S. Latifi, E. Regentova, and X. Wu, “Diagnosability of Star Graphs under the Comparison Diagnosis Model,” Information Processing Letters, vol. 93, no. 1, pp. 29-36, 2005.

Index Terms:
Multicomputer, system-level diagnosis, comparison model, PMC model, diagnosable system, diagnosis algorithm
Citation:
Xiaofan Yang, Yuan Yan Tang, "Efficient Fault Identification of Diagnosable Systems under the Comparison Model," IEEE Transactions on Computers, vol. 56, no. 12, pp. 1612-1618, Dec. 2007, doi:10.1109/TC.2007.70769