Browse > Article
http://dx.doi.org/10.6109/jkiice.2014.18.6.1361

Embedding Algorithms Hypercube, HCN, and HFN into HFCube Interconnection Networks  

Kim, Jong-Seok (Department of Computer Science, University of Rochester)
Lee, Hyeong-Ok (Department of Computer Education, Sunchon National University)
Publication Information
Journal of the Korea Institute of Information and Communication Engineering / v.18, no.6, 2014 , pp. 1361-1368 More about this Journal
Abstract
In this paper, we analyze emddings among HFCube(n,n), HCN(n,n), HFN(n,n) with lower network cost than that of Hypercube. The results are as follows. We propose that $Q_{2n}$ can be embedded into HFCube(n,n) with dilation 5, congestion 2. HCN(n,n) and HFN(n,n) are subgraphs of HFCube(n,n). HFCube(n,n) can be embedded into HFN(n,n) with dilation 3. HFCube(n,n) can be embedded into HCN(n,n) with dilation O(n). The results will be helpful to analyze several efficient properties in each interconnection network.
Keywords
Interconnection network; Hypercube; HCN; HFN; HFCube; Embedding;
Citations & Related Records
연도 인용수 순위
  • Reference
1 S. F. Nugent, "The iPSC/2 direct-connect communications technology," in Proceedings of the 3rd International Conference on Hypercube Concurrent Computers and Applications, pp. 51-60, 1988.
2 K. Ghose and K. R. Desai "Hierarchical cubic networks," IEEE Trans. Parallel Distributed Systems, vol.6, no.4, pp.427-436, 1995.   DOI   ScienceOn
3 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 Systems, vol. 6, no. 7, pp. 714-723, 1995.   DOI   ScienceOn
4 S. L. Johnsson and C.T. Ho, "Optimum broadcasting and personalized communication in hypercubes," IEEE Trans. Computers, vol. 38, no. 6, pp. 1249-1268, 1989.   DOI   ScienceOn
5 W. Deng and Q. Luo, "Embedding Complete Binary Trees into Locally Twisted Cubes," Advanced Engineering Forum, vol. 6-7, pp. 70-75, 2012.   DOI
6 M. Kim, D.-W. Kim, and H.-O. Lee, "Embedding Algorithms for Star, Bubble-Sort, Rotator-Faber-Moore, and Pancake Graphs," in Proceedings of the 10th International Conference on Algorithms and Architectures for Parallel Processing, pp. 348-357, 2010.
7 S. Ranka, J. Wang, and N. Yeh, "Embedding Meshes on the Star Graph," Journal of Parallel and Distributed Computing, vol. 19, pp. 131-135, 1993.   DOI   ScienceOn
8 H.-O. Lee, H. Sim, J.-H. Seo, and M. Kim, "Embedding Algorithms for Bubble-Sort, Macro-Star, and Transposition Graphs," in Proceedings of the 2010 IFIP International Conference on Network and Parallel Computing, pp. 134-143, 2010.
9 Q. Dong, J. Zhou, Y. Fu, and X. Yang, "Embedding a mesh of Trees in the Crossed Cube," Information Processing Letters, vol. 112, no. 14-15, pp. 599-603, 2012.   DOI   ScienceOn
10 El-Amawy. A. and S. Latifi, "Properties and performance of folded hypercubes," IEEE Trans. Parallel Distributed Systems, vol. 2, no. 1, pp. 31-42, 1991.   DOI   ScienceOn
11 Y. Shi, Z. Hou, and J. Song, "Hierarchical Interconnection Networks with Folded Hypercubes as Basic Clusters", in Proceedings of the 4th International Conference on High-Performance Computing in the Asia-Pacific Region, pp.134-137, 2000.
12 W. D. Hillis, The connection machine, MIT Press, 1985.
13 K. Hwang, Z. Xu, and M. Arakawa, "Benchmark evaluation of the IBM SP2 for parallel signal processing," IEEE Trans. Parallel and Distributed Systems, vol. 7, no. 5, pp 522-535, 1996.   DOI   ScienceOn
14 K. Day and A. Tripathi, "A comparative study of topological properties of hyprecubes and star graphs," IEEE Trans. Parallel and Distributed System, vol. 5, no. 1, pp. 31-38, 1994.   DOI   ScienceOn
15 D. A. Reed and H. D. Schwetman, "Cost-performance bounds for multimicrocomputer networks," IEEE Trans. Computers, vol. c-32, no. 1, pp. 83-95, 1983.
16 W. D. Hillis and L. W. Tucker, "The CM-5 connection machine: a scalable supercomputer," Communications of the ACM, vol. 36, pp. 30-40, 1993.
17 nCUBE Corporation, nCUBE 2S Programmer's Reference Manual, 1992.