Browse > Article
http://dx.doi.org/10.3745/KIPSTA.2002.9A.3.333

The Fault Tolerance of Interconnection Network HCN(n, n) and Embedding between HCN(n, n) and HFN(n, n)  

Lee, Hyeong-Ok (Dept.of Computer Science, Sunchon National University)
Kim, Jong-Seok (Graduate School of Sunchon National University)
Publication Information
The KIPS Transactions:PartA / v.9A, no.3, 2002 , pp. 333-340 More about this Journal
Abstract
Embedding is a mapping an interconnection network G to another interconnection network H. If a network G can be embedded to another network H, algorithms developed on G can be simulated on H. In this paper, we first propose a method to embed between Hierarchical Cubic Network HCN(n, n) and Hierarchical Folded-hypercube Network HFN(n, n). HCN(n, n) and HFN(n, n) are graph topologies having desirable properties of hypercube while improving the network cost, defined as degree${\times}$diameter, of Hypercube. We prove that HCN(n, n) can be embedded into HFN(n, n) with dilation 3 and congestion 2, and the average dilation is less than 2. HFN(n, n) can be embedded into HCN(n, n) with dilation 0 (n), but the average dilation is less than 2. Finally, we analyze the fault tolerance of HCN(n, n) and prove that HCN(n, n) is maximally fault tolerant.
Keywords
interconnection network; connectivity; fault tolerance; embedding;
Citations & Related Records
연도 인용수 순위
  • Reference
1 S. B. Akers and B. Krishnamurthy, 'On Group Graphs and Their Fatult Tolerance,' IEEE Trans. Comput., Vol.c-36, No.7, pp.885-888, July, 1987   DOI   ScienceOn
2 S. B. Akers and B. Krishnamurthy, 'A Group-Theoretic Model for Symmertric Interconnection Network,' IEEE Trans. Comput., Vol.38, No.4, pp.555-565, 1989   DOI   ScienceOn
3 W. J. Dally, 'Virtual-Channel Flow Control,' IEEE Trans. Parallel and Distributed Systems, Vol.3, No.2, pp.194-205, March, 1992   DOI   ScienceOn
4 K. W. Doty, 'New Designs for Dense Processor Interconnection Networks,' IEEE Trans. Computer., Vol.c-33, No.5, May, 1984   DOI   ScienceOn
5 D. R. Duh, G. H. Chen and J. F. Fang, 'Algorithms and Properties of a New Two-Level Network with Folded Hypercubes as Basic Modules,' IEEE Trans. Parallel Distributed syst., Vol.6, No.7, pp.714-723, 1995   DOI   ScienceOn
6 A. EI-Amawy and S. Latifi, 'Properties and Performance of Folded Hypercubes,' IEEE Trans. Parallel Distributed syst., Vol.2, No.1, pp.31-42, 1991   DOI   ScienceOn
7 T-Y. Feng, 'A Survey of Interconnection Networks,' IEEE Computer, pp.12-27, December, 1981   DOI   ScienceOn
8 K. Ghose and K. R. Desai, 'Hierarchical Cubic Networks,' IEEE Trans. Parallel Distributed syst., Vol.6, No.4, pp.427-436, 1995   DOI   ScienceOn
9 F. Harary, J. P. Hayes, and H-J.WU, 'A Survey of the Theory of Hypercube Graphs,' Comput. Math. Appl., Vol.15, pp.277-289, 1988   DOI   ScienceOn
10 K. Hwang and F. A. Briggs, Computer Architecture and Parallel Processing, 4th Printing, MacGraw-Hill International Editons, New York, 1988
11 V. E. Mendia and D. Sarkar, 'Optimal Broadcasting on the Star Graph,' IEEE Trans. Parallel Distributed syst., Vol.3, No.4, pp.389-396, 1992   DOI   ScienceOn
12 J-H.Park, Circulant Graphs and Their Application to Communication Networks, Ph.D.Thesis, Dept. of Computer Science, KAIST, Taejon Korea, 1992
13 D. A. Reed and R. M. Fujimoth, Multicomputer Networks : Message-Based Parallel Processing, MIT Press, 1987
14 S-K.Yun and K-H.Park, 'Comments on'Hierarchical Cubic Networks,' IEEE Trans. Parallel Distributed syst., Vol.9, No.4, pp.410-414, 1998   DOI   ScienceOn
15 A. S. Vaidya, P. S. N. Rao and S. R. Shankar, 'A Class of Hypercube_like Networks,' Proc. of the 5th IEEE Symposium on Parallel and Distributed Processing, pp.800-803, Dec., 1993   DOI
16 P. Wiley, 'A Parallel Architecture Comes of Age at Last,' IEEE Spectrum, Vol.24, pp.46-50, 1987
17 A. Y. Wu, 'Embedding of Tree Networks into Hypercubes,' J. Parallel and Distributed Computing, Vol.2, pp.238-249, 1985   DOI   ScienceOn
18 F. T. Leighton, Introduction to Parallel Algorithms and Architectures : Arrays, Hypercubes, Morgan Kaufmann Publishers, 1992