
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
ChunAn Chen, SunYuan Hsieh, "(t,k)Diagnosis for ComponentComposition Graphs under the MM* Model," IEEE Transactions on Computers, vol. 60, no. 12, pp. 17041717, December, 2011.  
BibTex  x  
@article{ 10.1109/TC.2010.201, author = {ChunAn Chen and SunYuan Hsieh}, title = {(t,k)Diagnosis for ComponentComposition Graphs under the MM* Model}, journal ={IEEE Transactions on Computers}, volume = {60}, number = {12}, issn = {00189340}, year = {2011}, pages = {17041717}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2010.201}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  (t,k)Diagnosis for ComponentComposition Graphs under the MM* Model IS  12 SN  00189340 SP1704 EP1717 EPD  17041717 A1  ChunAn Chen, A1  SunYuan Hsieh, PY  2011 KW  Comparison diagnosis model KW  componentcomposition graphs KW  the MM* model KW  (t KW  k)diagnosis KW  (t KW  k)diagnosability. VL  60 JA  IEEE Transactions on Computers ER   
[1] S.B. Akers, D. Horel, and B. Krishnamurthy, “The Star Graph: An Attractive Alternative to the $n$ Cube,” Proc. Int'l Conf. Parallel Processing, pp. 393400, 1987.
[2] S.B. Akers and B. Krishnamurthy, “A GroupTheoretic Model for Symmetric Interconnection Networks,” IEEE Trans. Computers, vol. 38, no. 4, pp. 555566, Apr. 1989.
[3] T. Araki and Y. Shibata, “Diagnosability of Butterfly Networks under the Comparison Approach,” IEICE Trans. Fundamentals of Electronics Comm. and Computer Science, vol. E85A, no. 5, pp. 11521160, 2002.
[4] T. Araki and Y. Shibata, “$(t,k)$ Diagnosable System: A Generalization of the PMC Models,” IEEE Trans. Computers, vol. 52, no. 7, pp. 971975, July 2003.
[5] L. Bhuyan and D.P. Agrawal, “Generalized Hypercubes and Hyperbus Structure for a Computer Network,” IEEE Trans. Computers, vol. 33, no. 4, pp. 323333, Apr. 1984.
[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. 314322, Apr. 2005.
[7] 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. 12801298, 2007.
[8] 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. 8892, Jan. 2006.
[9] G.Y. Chang, G.H. Chen, and G.J. Chang, “$(t,k)$ Diagnosis for Matching Composition Networks under the MM* Model,” IEEE Trans. Computers, vol. 56, no. 1, pp. 7379, Jan. 2007.
[10] G.Y. Chang, “$(t,k)$ Diagnosability for Regular Networks,” IEEE Trans. Computers, vol. 59, no. 9, pp. 11531157, Sept. 2010.
[11] F.B. Chedid, “On the Generalized Twisted Cube,” Information Processing Letters, vol. 55, no. 1, pp. 4952, 1995.
[12] P. Cull and S.M. Larson, “The Möbius Cubes,” IEEE Trans. Computers, vol. 44, no. 5, pp. 647659, May 1995.
[13] A.T. Dahabura and G.M. Masson, “An $o(n^{2.5})$ Fault Identification Algorithm for Diagnosable Systems,” IEEE Trans. Computers, vol. 33, no. 6, pp. 486492, June 1984.
[14] K. Efe, “A Variation on the Hypercube with Lower Diameter,” IEEE Trans. Computers, vol. 40, no. 11, pp. 13121316, Nov. 1991.
[15] K. Efe, “The Crossed Cube Architecture for Parallel Computation,” IEEE Trans. Parallel and Distributed Systems, vol. 3, no. 5, pp. 513524, Sept. 1992.
[16] J. Fan, “Diagnosability of the Möbius Cubes,” IEEE Trans. Parallel and Distributed Systems, vol. 9, no. 9, pp. 923928, Sept. 1998.
[17] J. Fan, “Diagnosability of Crossed Cubes under the Comparison Diagnosis Model,” IEEE Trans. Parallel and Distributed Systems, vol. 13, no. 7, pp. 687692, July 2002.
[18] J. Fan and X. Lin, “The $t/k$ Diagnosability of the BC Graphs,” IEEE Trans. Computers, vol. 54, no. 2, pp. 176184, Feb. 2005.
[19] P.A.J. Hilbers, M.R.J. Koopman, and J.L.A. van de Snepscheut, “The Twisted Cube,” Lecture Notes in Computer Science. pp. 152159, Springer, 1987.
[20] S.Y. Hsieh and Y.S. Chen, “Strongly Diagnosable Product Networks under the Comparison Diagnosis Model,” IEEE Trans. Computers, vol. 57, no. 6, pp. 721731, June 2008.
[21] S.Y. Hsieh and C.A. Chen, “Computing the $(t,k)$ Diagnosability of ComponentComposition Graphs and Its Application,” Proc. 21st Int'l Symp. Algorithms and Computation (ISAAC '10), 2010.
[22] J.S. Jwo, S. Lakshmivarahan, and S.K. Dhall, “A New Class of Interconnection Networks Based on the Alternating Group,” Networks, vol. 23, pp. 315326, 1993.
[23] K. Kaneko and N. Sawada, “An Algorithm for NodetoSet Disjoint Paths Problem in Burnt Pancake Graphs,” IEICE Trans. Information and Systems, vol. E86VD, no. 12, pp. 25882594, 2003.
[24] K. Kaneko and N. Sawada, “An Algorithm for NodetoNode Disjoint Paths Problem in Burnt Pancake Graphs,” IEICE Trans. Information and Systems, vol. E90VD, no. 1, pp. 306313, 2007.
[25] A. Kavianpour, “Sequential Diagnosability of Star Graphs,” Computers and Electrical Eng., vol. 22, no. 1, pp. 3744, 1996.
[26] A. Kavianpour and K.H. Kim, “Diagnosabilities of Hypercubes under the Pessimistic OneStep Diagnosis Strategy,” IEEE Trans. Computers, vol. 40, no. 2, pp. 232237, Feb. 1991.
[27] A. Kavianpour and K.H. Kim, “A Comparative Evaluation of Four Basic SystemLevel Diagnosis Strategies for Hypercubes,” IEEE Trans. Computers, vol. 41, no. 1, pp. 2637, Mar. 1992.
[28] S. Khanna and W.K. Fuchs, “A Linear Time Algorithm for Sequential Diagnosis in Hypercubes,” J. Parallel and Distributed Computing, vol. 26, pp. 4853, 1995.
[29] S. Khanna and W.K. Fuchs, “A Graph Partitioning Approach to Sequential Diagnosis,” IEEE Trans. Computers, vol. 46, no. 1, pp. 3947, Jan. 1997.
[30] 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. 10641069, Aug. 2004.
[31] S. Lakshmivarahan, J.S. Jwo, and S.K. Dhall, “Symmetry in Interconnection Networks Based on Cayley Graphs of Permutation Groups: A Survey,” Parallel Computing, vol. 19, no. 4, pp. 361407, 1993.
[32] F.T. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan Kaufmann, 1992.
[33] C.K. Lin, J.J.M. Tan, L.H. Hsu, E. Cheng, and L. Lipták, “Conditional Diagnosability of Cayley Graphs Generated by Transposition Trees under the Comparison Diagnosis Model,” J. Interconnection Networks, vol. 9, nos. 1/2, pp. 8397, 2008.
[34] J. Maeng and M. Malek, “A Comparison Connection Assignment for SelfDiagnosis of Multiprocessor Systems,” Proc. 11th Int'l Symp. Fault Tolerant Computing, pp. 173175, 1981.
[35] M. Malek, “A Comparison Connection Assignment for Diagnosable of Multiprocessor Systems,” Proc. Seventh Int'l Symp. Computer Architecture, pp. 3136, 1980.
[36] J.H. Park, H.S. Lim, and H.C. Kim, “Panconnectivity and Pancyclicity of HypercubeLike Interconnection Networks with Faulty Elements,” Theoretical Computer Science, vol. 377, pp. 170180, 2007.
[37] J.H. Park and K.Y. Chwa, “Recursive Circulants and Their Embeddings among Hypercubes,” Theoretical Computer Science, vol. 244, pp. 3562, 2000.
[38] F.P. Preparata, G. Metze, and R.T. Chien, “On the Connection Assignment Problem of Diagnosable Systems,” IEEE Trans. Electronic Computers, vol. EC16, no. 6, pp. 848854, Dec. 1967.
[39] A. Sengupta and A.T. Danbura, “On SelfDiagnosable Multiprocessor Systems: Diagnosis by the Comparison Approach,” IEEE Trans. Computers, vol. 41, no. 11, pp. 13861396, Nov. 1992.
[40] N.K. Singhvi and K. Ghose, “The Mcube: A Symmetrical Cube Based Network with Twisted Links,” Proc. Ninth IEEE Int'l Parallel Processing Symp. (IPPS '95), pp. 1116, 1995.
[41] A.K. Somani and O. Peleg, “On Diagnosability of Large Fault Sets in Regular TopologyBased Computer Systems,” IEEE Trans. Computers, vol. 45, no. 8, pp. 892902, Aug. 1996.
[42] Y. Suzuki and K. Kaneko, “An Algorithm for NodeDisjoint Paths in Pancake Graphs,” IEICE Trans. Information and Systems, vol. E86D, no. 3, pp. 610615, 2003.
[43] A.S. Vaidya, P.S.N. Rao, and S.R. Shankar, “A Class of HypercubeLike Networks,” Proc. Fifth Symp. Parallel and Distributed Processing, pp. 800803, 1993.
[44] D. Wang, “Diagnosability of Enhanced Hypercubes,” IEEE Trans. Computers, vol. 43, no. 9, pp. 10541061, Sept. 1994.
[45] D. Wang, “Diagnosability of Hypercubes and Enhanced Hypercubes under the Comparison Diagnosis Model,” IEEE Trans. Computers, vol. 48, no. 12, pp. 13691374, Dec. 1999.
[46] J. Xu and S. ze Huang, “Sequentially $t$ Diagnosable System: A Characterization and Its Applications,” IEEE Trans. Computers, vol. 44, no. 2, pp. 340345, Feb. 1995.
[47] T. Yamada, T. Ohtsukab, A. Watanabe, and S. Ueno, “On Sequential Diagnosis of Multiprocessor Systems,” Discrete Applied Math., vol. 146, no. 3, pp. 311342, 2005.
[48] X. Yang, “A Linear Time Fault Diagnosis Algorithm for Hypercube Multiprocessors under the MM* Comparison Model,” Proc. 12th Asian Test Symp., pp. 5057, 2003.
[49] X. Yang, D.J. Evans, and G.M. Megson, “The Locally Twisted Cubes,” Int'l J. Computer Math., vol. 82, no. 4, pp. 401413, 2005.
[50] J. Zheng, S. Latifi, E. Regentova, K. Luo, and X. Wu, “Diagnosability of Star Graphs under the Comparison Diagnosis Model,” Information Processing Letters, vol. 93, no. 1, pp. 2936, 2005.