(t,k)-diagnosis for component-composition graphs under the MM* model

IEEE Transactions on Computers

Volumn 60, Issue 12, 2011, Pages 1704-1717

  Chen, Chun An ^a   Hsieh, Sun Yuan ^a  

^a NATIONAL CHENG KUNG UNIVERSITY   (Taiwan)

Author keywords

(t; Comparison diagnosis model; component composition graphs; k) diagnosability; k) diagnosis; model; the MM

Indexed keywords

(T; COMPARISON DIAGNOSIS MODEL; COMPONENT-COMPOSITION GRAPHS; DIAGNOSABILITY; THE MM;

GEOMETRY; GRAPHIC METHODS; HYPERCUBE NETWORKS; MODELS;

GRAPH THEORY;

EID: 84873465914     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/TC.2010.201     Document Type: Article

References (50)

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. 393-400, 1987. (Pubitemid 18523636)
2. S.B. Akers and B. Krishnamurthy, "A Group-Theoretic Model for Symmetric Interconnection Networks," IEEE Trans. Computers, vol. 38, no. 4, pp. 555-566, 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. E85-A, no. 5, pp. 1152-1160, 2002. (Pubitemid 34962649)
4. 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.
5. L. Bhuyan and D.P. Agrawal, "Generalized Hypercubes and Hyperbus Structure for a Computer Network," IEEE Trans. Computers, vol. 33, no. 4, pp. 323-333, Apr. 1984. (Pubitemid 14564699)
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-322, 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. 1280-1298, 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. 88-92, 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. 73-79, Jan. 2007.
10. G.Y. Chang, "(t,k)-Diagnosability for Regular Networks," IEEE Trans. Computers, vol. 59, no. 9, pp. 1153-1157, Sept. 2010.
11. F.B. Chedid, "On the Generalized Twisted Cube," Information Processing Letters, vol. 55, no. 1, pp. 49-52, 1995.
12. P. Cull and S.M. Larson, "The Möbius Cubes," IEEE Trans. Computers, vol. 44, no. 5, pp. 647-659, May 1995.
13. A.T. Dahabura and G.M. Masson, "An on2:5 Fault Identification Algorithm for Diagnosable Systems," IEEE Trans. Computers, vol. 33, no. 6, pp. 486-492, June 1984.
14. K. Efe, "A Variation on the Hypercube with Lower Diameter," IEEE Trans. Computers, vol. 40, no. 11, pp. 1312-1316, Nov. 1991.
15. K. Efe, "The Crossed Cube Architecture for Parallel Computation," IEEE Trans. Parallel and Distributed Systems, vol. 3, no. 5, pp. 513-524, Sept. 1992. (Pubitemid 23556076)
16. J. Fan, "Diagnosability of the Möbius Cubes," IEEE Trans. Parallel and Distributed Systems, vol. 9, no. 9, pp. 923-928, 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. 687-692, July 2002.
18. 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.
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. 152-159, 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. 721-731, June 2008.
21. S.Y. Hsieh and C.A. Chen, "Computing the (t,k)-Diagnosability of Component-Composition 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. 315-326, 1993.
23. K. Kaneko and N. Sawada, "An Algorithm for Node-to-Set Disjoint Paths Problem in Burnt Pancake Graphs," IEICE Trans. Information and Systems, vol. E86VD, no. 12, pp. 2588-2594, 2003.
24. K. Kaneko and N. Sawada, "An Algorithm for Node-to-Node Disjoint Paths Problem in Burnt Pancake Graphs," IEICE Trans. Information and Systems, vol. E90VD, no. 1, pp. 306-313, 2007. (Pubitemid 46145334)
25. A. Kavianpour, "Sequential Diagnosability of Star Graphs," Computers and Electrical Eng., vol. 22, no. 1, pp. 37-44, 1996. (Pubitemid 126385004)
26. A. Kavianpour and K.H. Kim, "Diagnosabilities of Hypercubes under the Pessimistic One-Step Diagnosis Strategy," IEEE Trans. Computers, vol. 40, no. 2, pp. 232-237, Feb. 1991.
27. A. Kavianpour and K.H. Kim, "A Comparative Evaluation of Four Basic System-Level Diagnosis Strategies for Hypercubes," IEEE Trans. Computers, vol. 41, no. 1, pp. 26-37, 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. 48-53, 1995.
29. 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. (Pubitemid 127760614)
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. 1064-1069, 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. 361-407, 1993. (Pubitemid 23686249)
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. 83-97, 2008.
34. 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. (Pubitemid 12442810)
35. M. Malek, "A Comparison Connection Assignment for Diagnosable of Multiprocessor Systems," Proc. Seventh Int'l Symp. Computer Architecture, pp. 31-36, 1980.
36. J.H. Park, H.S. Lim, and H.C. Kim, "Panconnectivity and Pancyclicity of Hypercube-Like Interconnection Networks with Faulty Elements," Theoretical Computer Science, vol. 377, pp. 170-180, 2007.
37. J.H. Park and K.Y. Chwa, "Recursive Circulants and Their Embeddings among Hypercubes," Theoretical Computer Science, vol. 244, pp. 35-62, 2000.
38. F.P. Preparata, G. Metze, and R.T. Chien, "On the Connection Assignment Problem of Diagnosable Systems," IEEE Trans. Electronic Computers, vol. EC-16, no. 6, pp. 848-854, Dec. 1967.
39. A. Sengupta and A.T. Danbura, "On Self-Diagnosable Multiprocessor Systems: Diagnosis by the Comparison Approach," IEEE Trans. Computers, vol. 41, no. 11, pp. 1386-1396, 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. 11-16, 1995.
41. 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-902, Aug. 1996.
42. Y. Suzuki and K. Kaneko, "An Algorithm for Node-Disjoint Paths in Pancake Graphs," IEICE Trans. Information and Systems, vol. E86-D, no. 3, pp. 610-615, 2003.
43. A.S. Vaidya, P.S.N. Rao, and S.R. Shankar, "A Class of Hypercube-Like Networks," Proc. Fifth Symp. Parallel and Distributed Processing, pp. 800-803, 1993.
44. D. Wang, "Diagnosability of Enhanced Hypercubes," IEEE Trans. Computers, vol. 43, no. 9, pp. 1054-1061, Sept. 1994.
45. 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. (Pubitemid 30553395)
46. J. Xu and S. ze Huang, "Sequentially t-Diagnosable System: A Characterization and Its Applications," IEEE Trans. Computers, vol. 44, no. 2, pp. 340-345, 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. 311-342, 2005. (Pubitemid 40120761)
48. X. Yang, "A Linear Time Fault Diagnosis Algorithm for Hypercube Multiprocessors under the MM Comparison Model," Proc. 12th Asian Test Symp., pp. 50-57, 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. 401-413, 2005. (Pubitemid 41663455)
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. 29-36, 2005.