Publication 2010 Issue No. 9 - September Abstract - (t, k)-Diagnosability for Regular Networks
(t, k)-Diagnosability for Regular Networks
September 2010 (vol. 59 no. 9)
pp. 1153-1157
 ASCII Text x Guey-Yun Chang, "(t, k)-Diagnosability for Regular Networks," IEEE Transactions on Computers, vol. 59, no. 9, pp. 1153-1157, September, 2010.
 BibTex x @article{ 10.1109/TC.2010.16,author = {Guey-Yun Chang},title = {(t, k)-Diagnosability for Regular Networks},journal ={IEEE Transactions on Computers},volume = {59},number = {9},issn = {0018-9340},year = {2010},pages = {1153-1157},doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2010.16},publisher = {IEEE Computer Society},address = {Los Alamitos, CA, USA},}
 RefWorks Procite/RefMan/Endnote x TY - JOURJO - IEEE Transactions on ComputersTI - (t, k)-Diagnosability for Regular NetworksIS - 9SN - 0018-9340SP1153EP1157EPD - 1153-1157A1 - Guey-Yun Chang, PY - 2010KW - DiagnosabilityKW - diagnosis algorithmKW - fault diagnosisKW - matching compositionKW - networkKW - PMC modelKW - system-level diagnosisKW - (tKW - k)-diagnosisKW - torus.VL - 59JA - IEEE Transactions on ComputersER -
Guey-Yun Chang, National Central University, Taoyuan
System-level diagnosis aims to identify faulty processors in a multiprocessor system by means of analyzing the test results among the processors. (t,k)-Diagnosis, which is one of the most important system-level diagnosis strategies, requires at least k faulty processors identified in each iteration provided there are at most t faulty processors, where t \ge k. In this paper, a new (t,k)-diagnosis algorithm for regular networks is proposed. Experimental results show that the proposed algorithm has larger values of t for tori and matching composition networks, in comparison with previous (t,k)-diagnosis algorithms.

[1] T. Araki and Y. Shibata, "($t,k$ )-Diagnosable System: A Generalization of the PMC Models," IEEE Trans. Computers, vol. 52, no. 7, pp. 971-975, July 2003.
[2] J.R. Armstrong and F.G. Gray, "Fault Diagnosis in a Boolean $n$ -Cube Array of Microprocessors," IEEE Trans. Computers, vol. 30, no. 8, pp. 587-590, Aug. 1981.
[3] A. Caruso, S. Chessa, P. Maestrini, and P. Santi, "Diagnosability of Regular Systems," J. Algorithms, vol. 45, pp. 126-143, 2002.
[4] A. Caruso, S. Chessa, and P. Maestrini, "Worst-Case Diagnosis Completeness in Regular Graphs under the PMC Model," IEEE Trans. Computers, vol. 56, no. 7, pp. 917-924, July 2007.
[5] C.P. Chang, P.L. Lai, J.M. Tan, and L.H. Hsu, "Diagnosability of $t$ -Connected Networks and Product Networks under the Comparison Diagnosis Model," IEEE Trans. Computers, vol. 53, no. 12, pp. 1582-1590, Dec. 2004.
[6] 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.
[7] G.Y. Chang, G.H. Chen, and G.J. Chang, "($t,k$ )-Diagnosis for Matching Composition Networks," IEEE Trans. Computers, vol. 55, no. 1, pp. 88-92, Jan. 2006.
[8] G.Y. Chang, G.H. Chen, and G.J. Chang, "($t,k$ )-Diagnosis for Matching Composition Networks Under the ${\rm MM}^\ast$ Model," IEEE Trans. Computers, vol. 56, no. 1, pp. 73-79, Jan. 2007.
[9] G.Y. Chang and G.H. Chen, "$(t,k)$ -Diagnosability of Multiprocessor Systems with Applications to Grids and Tori," SIAM J. Computing, vol. 37, no. 4, pp. 1280-1298, 2007.
[10] A.T. Dahabura and G.M. Masson, "An $O(n^{2.5})$ Fault Identification Algorithm for Diagnosable System," IEEE Trans. Computers, vol. 33, no. 6, pp. 486-492, June 1984.
[11] J. Fan, "Diagnosability of the Möbius Cubes," IEEE Trans. Parallel and Distributed Systems, vol. 9, no. 9, pp. 923-927, Sept. 1998.
[12] A. Kavianpour, "Sequential Diagnosability of Star Graphs," Computers and Electrical Eng., vol. 22, no. 1, pp. 37-44, 1996.
[13] S. Khanna and W.K. Fuchs, "A Linear Time Algorithm for Sequential Diagnosis in Hypercubes," J. Parallel and Distributed Computing, vol. 26, pp. 38-53, 1995.
[14] S. Khanna and W.K. Fuchs, "A Graph Partitioning Approach to Sequential Diagnosis," IEEE Trans. Computers, vol. 46, no. 1, pp. 39-47, Jan. 1997.
[15] P.L. Lai, 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.
[16] F.P. Preparata, G. Metze, and R.T. Chien, "On the Connection Assignment Problem of Diagnosable Systems," IEEE Trans. Electronic Computers, vol. 16, no. 6, pp. 848-854, Dec. 1967.
[17] P. Santi and S. Chessa, "Reducing the Number of Sequential Diagnosis Iteration in Hypercubes," IEEE Trans. Computers, vol. 53, no. 1, pp. 89-92, Jan. 2004.
[18] D. Wang, "Diagnosability of Enhanced Hypercubes," IEEE Trans. Computers, vol. 43, no. 9, pp. 1054-1061, Sept. 1994.
[19] 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.

Index Terms:
Diagnosability, diagnosis algorithm, fault diagnosis, matching composition, network, PMC model, system-level diagnosis, (t,k)-diagnosis, torus.
Citation:
Guey-Yun Chang, "(t, k)-Diagnosability for Regular Networks," IEEE Transactions on Computers, vol. 59, no. 9, pp. 1153-1157, Sept. 2010, doi:10.1109/TC.2010.16