Browse > Article

Embedding Complete Binary Trees into Crossed Cubes  

Kim, Sook-Yeon (한경대학교 컴퓨터공학과)
Publication Information
Journal of KIISE:Computer Systems and Theory / v.36, no.3, 2009 , pp. 149-157 More about this Journal
Abstract
The crossed cube, a variation of the hypercube, possesses a better topological property than the hypercube in its diameter that is about half of that of the hypercube. It has been known that an N-node complete binary tree is a subgraph of an (N+1)-node crossed cube [P. Kulasinghe and S. Bettayeb, 1995]. However, efficient embedding methods have not been known for the case that the number of nodes of the complete binary tree is greater than that of the crossed cube. In this paper, we show that an N-node complete binary tree can be embedded into an M-node crossed cube with dilation 1 and load factor [N/M], N>M$\geq$2. The dilation and load factor is optimal. Our embedding has a property that the tree nodes on the same level are evenly distributed over the crossed cube nodes. The property is especially useful when tree-structured algorithms are processed on a crossed cube in a level-by-level way.
Keywords
crossed cube; complete binary tree; dilation; load factor; tree-structured algorithm;
Citations & Related Records
연도 인용수 순위
  • Reference
1 H.-S. Hung, J.-S. Fu, G.-H. Chen, "Fault-free hamiltonian cycles in crossed cubes with conditional link faults," Information Sciences, Vol.177, No.24, pp. 5664-5674, 2007.   DOI   ScienceOn
2 V. Heun and E.W. Mayr, "Optimal dynamic embeddings of complete binary trees into hypercubes," Journal of Parallel and Distributed Computing, Vol.61, Issue 8, pp. 1110-1125, Aug. 2001.   DOI
3 K. Efe, "The crossed cube architecture for parallel computing," IEEE Trans. Parallel and Distributed Systems, Vol.3, No.5, pp. 513-524, Sept.-Oct. 1992.   DOI   ScienceOn
4 K. Efe, P.K. Blachwell, W. Slough, and T. Shiau, "Topological properties of the crossed cube architecture," Parallel Computing, Vol.20, pp. 1763-1775, 1994.   DOI   ScienceOn
5 W.-T. Huang, Y.-C. Chuang, J.M. Tan, and L.-H. Hsu, "On the fault-tolerant hamiltonicity of faulty crossed cubes," IEICE Trans. Fundamentals, Vol.E85-A, No.6, pp. 1359-1370, Jun. 2002.
6 M.-C. Yang, T.-K. Li, J.J.M. Tan, and L.-H. Hsu, "Fault-tolerant cycle-embedding of crossed cubes," Information Processing Letters, Vol.88, No.4, pp. 149-154, Nov. 2003.   DOI   ScienceOn
7 P. Kulasinghe and S. Bettayeb, "Embedding binary trees into crossed cubes," IEEE Trans. Computers, Vol.44, No.7, pp. 923-929, Jul. 1995.   DOI   ScienceOn
8 J. Fan, X. Jia, "Embedding meshes into crossed cubes," Information Sciences Vol.177, No.15, pp. 3151-3160, 2007.   DOI   ScienceOn
9 Q. Dong, X. Yang, J. Zhao and Y.Y. Tang, "Embedding a family of disjoint 3D meshes into a crossed cube," Information Sciences, In Press, 2008.
10 J. Fan, X. Jia, and X. Lin, "Complete path embeddings in crossed cubes," Information Sciences Vol. 176, No.22, pp. 3332-3346, 2006.   DOI   ScienceOn
11 J. Fan, X. Lin, and X. Jia, "Optimal path embedding in crossed cubes," IEEE Transactions on Parallel and Distributed Systems, Vol.16, No.12, pp. 1190-1200, 2005.   DOI
12 J.-M. Xu, M. Ma, and M. Lv, "Paths in mobius cubes and crossed cubes," Information Processing Letters, Vol.97, No.3, pp. 94-97, 2006.   DOI   ScienceOn
13 J. Fan and X. Jia, "Edge-pancyclicity and pathembeddability of bijective connection graphs," Information Sciences, Vol.178, No.2, pp. 340-351, 2008.   DOI   ScienceOn
14 J. Fan, X. Lin, and X. Jia, "Node-pancyclicity and edge-pancyclicity of crossed cubes," Information Processing Letters, Vol.93, pp.133-138, Feb. 2005.   DOI   ScienceOn
15 K. Efe, "A variation on the hypercube with lower diameter," IEEE Trans. Computers, Vol.40, No.11, pp. 1312-1316, Nov. 1991.   DOI   ScienceOn
16 C.-P. Chang, T.-Y. Sung, and L.-H. Hsu, "Edge congestion and topological properties of crossed cubes," IEEE Trans. Parallel and Distributed Systems, Vol.11, No.1, pp. 64-80, Jan. 2000.   DOI   ScienceOn