한국정보과학회논문지:시스템및이론 (Journal of KIISE:Computer Systems and Theory)

한국정보과학회 (Korean Institute of Information Scientists and Engineers)
권호 표지

완전이진트리의 교차큐브에 대한 임베딩

Embedding Complete Binary Trees into Crossed Cubes

  • 김숙연 (한경대학교 컴퓨터공학과)
  • 발행 : 2009.06.15
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

교차큐브는 하이퍼큐브의 변형으로서 하이퍼큐브의 절반정도의 지름을 가지는 등의 개선된 망 성질을 가진다. N-노드 완전이진트리는 (N+1)-노드 교차큐브의 부그래프임이 알려져 있으나 [P. Kulasinghe and S, Bettayeb, 1995] 완전이진트리의 노드 개수가 교차큐브의 노드 개수보다 더 큰 경우에 대한 효과적인 임베딩 방법은 알려져 있지 않다. 본 논문에서는 N-노드 완전이진트리를 N-노드 교차큐브에 연장을 1, 부하율 [N/M]로 임베딩할 수 있음을 보인다(N>M$\geq$2). 여기서 연장율과 부하율은 최적이다. 본 논문에서 제시하는 임베딩 방법은 같은 레벨의 트리 노드들을 교차큐브의 노드들에 골고루 분포시키는 특징도 가지고 있다. 이 특징은 트리 구조 알고리즘을 교차큐브에서 레벨 단위로 실행할 때 특히 유용하다.

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.

키워드

참고문헌

  1. 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. https://doi.org/10.1109/71.824643
  2. K. Efe, "A variation on the hypercube with lower diameter," IEEE Trans. Computers, Vol.40, No.11, pp. 1312-1316, Nov. 1991. https://doi.org/10.1109/12.102840
  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. https://doi.org/10.1109/71.159036
  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. https://doi.org/10.1016/0167-8191(94)90130-9
  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. https://doi.org/10.1016/j.ipl.2003.08.007
  7. P. Kulasinghe and S. Bettayeb, "Embedding binary trees into crossed cubes," IEEE Trans. Computers, Vol.44, No.7, pp. 923-929, Jul. 1995. https://doi.org/10.1109/12.392850
  8. J. Fan, X. Jia, "Embedding meshes into crossed cubes," Information Sciences Vol.177, No.15, pp. 3151-3160, 2007. https://doi.org/10.1016/j.ins.2006.12.010
  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. https://doi.org/10.1016/j.ins.2006.01.001
  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. https://doi.org/10.1109/TPDS.2005.151
  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. https://doi.org/10.1016/j.ipl.2005.09.015
  13. J. Fan and X. Jia, "Edge-pancyclicity and pathembeddability of bijective connection graphs," Information Sciences, Vol.178, No.2, pp. 340-351, 2008. https://doi.org/10.1016/j.ins.2007.08.012
  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. https://doi.org/10.1016/j.ipl.2004.09.026
  15. 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. https://doi.org/10.1016/j.ins.2007.05.032
  16. 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. https://doi.org/10.1006/jpdc.2001.1734