Browse > Article

Link-Disjoint Embedding of Complete Binary Trees in 3D-Meshes  

이주영 (덕성여자대학교 전산학과)
이상규 (숙명여자대학교 컴퓨터과학과)
Publication Information
Journal of KIISE:Computer Systems and Theory / v.30, no.7_8, 2003 , pp. 381-386 More about this Journal
Abstract
In this paper, we consider the problem of embedding complete binary trees into 3-dimensional meshes. The method of embedding a complete binary tree into 3-dimensional mesh with the link congestion two is considered in [1], and the embedding in [2] shows that a complete binary tree can be embedded into a ,3-dimensional mesh of expansion 1.27. The proposed embedding in this paper shows that a complete binary tree can be embedded into a 3-dimensional mesh of expansion approximately 1.125 with the link congestion one, using the dimensional ordered routing. Such method yields some improved features in terms of minimizing the link congestion or the expansion of embedding comparing to the previous results.
Keywords
embedding; dimensional ordered routing; mesh interconnection networks; complete binary tree; link congestion;
Citations & Related Records
연도 인용수 순위
  • Reference
1 U. K. Lee and H. A. Choi, 'Embedding of Complete Binary Trees into Meshes with Row Column Routing', IEEE Transaction on Parallel and Distributed Systems, Vol. 7, No. 5, pp.493-497, 1996, May   DOI   ScienceOn
2 J. D. Ullman, 'Computational Aspects of VLSI', Computer Science Press, 11, Taft Court, Rockville, Maryland 20850, U.S.A. 1984
3 J. E. Brandenburg and D. S. Scott, 'Embedding of Communication Trees and Grids into Hypercubes,' Technical Report, Intel Scientific Computers, 1985
4 S. N. Bhatt and S. S. Cosmadakis, 'The Complexity of Minimizing Wire Lengths for VLSI Layouts,' Information Processing Letters, Vol. 25, pp 263-267, 1987   DOI   ScienceOn
5 S. K. Lee and H. A. Choi, 'Link Disjoint Embedding of Complete Binary Tress in Meshes', Networks Journal, Vol. 30, No. 4, pp 283-292, 1997   DOI   ScienceOn
6 S. M. Park, S. K. Lee and B. H. Moon, 'Link Disjoint Embedding of Complete Binary Trees into 3D Meshes with Dimension Ordered Routing', 한국정보과학회 병렬처리연구회 1998년 춘계 학술발표회, pp. 85-96, 1998
7 B. Monien and H. Sudborough, 'Embedding One Interconnection Network in Another,' Preprint, 1992
8 A. Gibbons and M. Patterson, 'Dense Edge Disjoint Embedding of Binary Trees in the Mesh', Proc. of 4th Annual ACM Symposium on Parallel Algorithms and Architecture, pp. 257-263, 1992   DOI
9 L. M. Ni and P. K. McKinley, 'A Survey of Routing Techniques in Wormhole Networks,' IEEE Computers, pp. 62-76, Feb. 1993   DOI   ScienceOn