The complexity of minimizing wire lengths in VLSI layouts
Information Processing Letters
Dense edge-disjoint embedding of binary trees in the mesh
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Computational Aspects of VLSI
IEEE Transactions on Parallel and Distributed Systems
On the fault-tolerant embeddings of complete binary trees in the mesh interconnection networks
Information Sciences—Informatics and Computer Science: An International Journal
An Augmented k-ary Tree Multiprocessor with Real-Time Fault-Tolerant Capability
The Journal of Supercomputing
FLUX interconnection networks on demand
Journal of Systems Architecture: the EUROMICRO Journal
Partially reconfigurable point-to-point interconnects in Virtex-II pro FPGAs
ARC'07 Proceedings of the 3rd international conference on Reconfigurable computing: architectures, tools and applications
Minimum congestion embedding of complete binary trees into tori
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Embedding-based placement of processing element networks on FPGAs for physical model simulation
Proceedings of the ACM/SIGDA international symposium on Field programmable gate arrays
Predicting application performance using supervised learning on communication features
SC '13 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
| Hi-index | 0.00 |
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.