Publication 1996 Issue No. 5 - May Abstract - Embedding of Complete Binary Trees into Meshes with Row-Column Routing
Embedding of Complete Binary Trees into Meshes with Row-Column Routing
May 1996 (vol. 7 no. 5)
pp. 493-497
 ASCII Text x Sang-Kyu Lee, Hyeong-Ah Choi, "Embedding of Complete Binary Trees into Meshes with Row-Column Routing," IEEE Transactions on Parallel and Distributed Systems, vol. 7, no. 5, pp. 493-497, May, 1996.
 BibTex x @article{ 10.1109/71.503774,author = {Sang-Kyu Lee and Hyeong-Ah Choi},title = {Embedding of Complete Binary Trees into Meshes with Row-Column Routing},journal ={IEEE Transactions on Parallel and Distributed Systems},volume = {7},number = {5},issn = {1045-9219},year = {1996},pages = {493-497},doi = {http://doi.ieeecomputersociety.org/10.1109/71.503774},publisher = {IEEE Computer Society},address = {Los Alamitos, CA, USA},}
 RefWorks Procite/RefMan/Endnote x TY - JOURJO - IEEE Transactions on Parallel and Distributed SystemsTI - Embedding of Complete Binary Trees into Meshes with Row-Column RoutingIS - 5SN - 1045-9219SP493EP497EPD - 493-497A1 - Sang-Kyu Lee, A1 - Hyeong-Ah Choi, PY - 1996KW - EmbeddingKW - complete binary treeKW - meshKW - row-column routingKW - link congestion.VL - 7JA - IEEE Transactions on Parallel and Distributed SystemsER -

Abstract—This paper considers the problem of embedding complete binary trees into meshes using the row-column routing and obtained the following results: a complete binary tree with 2p− 1 nodes can be embedded 1) with link congestion one into a ${9 \over 8}\sqrt{2^p}\times {9 \over 8}\sqrt{2^p}$ mesh when p is even and a $\sqrt{{\textstyle{9 \over 8}} {2^p}}\times \sqrt{{\textstyle{9 \over 8}} {2^p}}$ mesh when p is odd, and 2) with link congestion two into a $\sqrt{2^p}\times \sqrt{2^p}$ mesh when p is even, and a $\sqrt{2^{p-1}}\times 2\sqrt{2^{p-1}}$ mesh when p is odd.

[1] S. Bhatt, F. Chung, T. Leighton, and A. Rosenberg, "Optimal Simulations of Tree Machines," Proc. 27th Ann. IEEE Symp. Foundations of Computer Science, pp. 274-282, Oct. 1986.
[2] S.N. Bhatt and S.S. Cosmadakis, "The Complexity of Minimizing Wire Lengths for VLSI Layouts," Information Processing Letters, vol. 25, 1987.
[3] J.E. Brandenburg and D.S. Scott, "Embeddings of Communication Trees and Grids into Hypercubes," technical report, Intel Scientific Computers, 1985.
[4] A. Gibbons and M. Patterson, "Dense Edge-Disjoint Embedding of Binary Trees in the Mesh," Proc. Fourth Ann. ACM Symp. Parallel Algorithms and Architecture, pp. 257-263, 1992.
[5] S.-K. Lee and H.-A. Choi, "Embedding Complete Binary Trees on Square Meshes with Small Link Congestion," Proc. 30th Ann. Allerton Conf. Comm., Control, and Computing, Sept. 1992.
[6] S.-K. Lee and H.-A. Choi, "Link-Disjoint Embedding of Complete Binary Trees in d-Dimensional Meshes," submitted for publication.
[7] B. Monien and H. Sudborough, "Embedding One Interconnection Network in Another," preprint, 1992.
[8] L.M. Ni and P.K. McKinley, "A Survey of Routing Techniques in Wormhole Networks," Technical Report MSU-CPS-ACS-46, Oct.17, 1991.
[9] A. Rosenberg, "Data Encoding and Their Costs," Acta Informatica, no. 9, 1978.
[10] J.D. Ullman, Computational Aspects of VLSI.Rockville, Md.: Computer Science Press, 1984.

Index Terms:
Embedding, complete binary tree, mesh, row-column routing, link congestion.
Citation:
Sang-Kyu Lee, Hyeong-Ah Choi, "Embedding of Complete Binary Trees into Meshes with Row-Column Routing," IEEE Transactions on Parallel and Distributed Systems, vol. 7, no. 5, pp. 493-497, May 1996, doi:10.1109/71.503774