
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
SangKyu Lee, HyeongAh Choi, "Embedding of Complete Binary Trees into Meshes with RowColumn Routing," IEEE Transactions on Parallel and Distributed Systems, vol. 7, no. 5, pp. 493497, May, 1996.  
BibTex  x  
@article{ 10.1109/71.503774, author = {SangKyu Lee and HyeongAh Choi}, title = {Embedding of Complete Binary Trees into Meshes with RowColumn Routing}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {7}, number = {5}, issn = {10459219}, year = {1996}, pages = {493497}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.503774}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  Embedding of Complete Binary Trees into Meshes with RowColumn Routing IS  5 SN  10459219 SP493 EP497 EPD  493497 A1  SangKyu Lee, A1  HyeongAh Choi, PY  1996 KW  Embedding KW  complete binary tree KW  mesh KW  rowcolumn routing KW  link congestion. VL  7 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Abstract—This paper considers the problem of embedding complete binary trees into meshes using the rowcolumn routing and obtained the following results: a complete binary tree with 2
[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. 274282, 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 EdgeDisjoint Embedding of Binary Trees in the Mesh," Proc. Fourth Ann. ACM Symp. Parallel Algorithms and Architecture, pp. 257263, 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, "LinkDisjoint Embedding of Complete Binary Trees in dDimensional 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 MSUCPSACS46, 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.