Embedding of complete binary trees into meshes with row-columnrouting |
| |
Authors: | Sang-Kyu Lee Hyeong-Ah Choi |
| |
Affiliation: | Dept. of Electr. Eng. & Comput. Sci., George Washington Univ., Washington, DC; |
| |
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/8√(2p)×9/ 8√(2p) mesh when p is even and a √( 9/82p)×√(9/ 82p) mesh when p is odd, and (2) with link congestion two into a √(2p)×√(2p) mesh when p is even, and a √(2p-1)×√(2p-1) mesh when p is odd |
| |
Keywords: | |
|
|