VLSI layout of binary tree structures |
| |
| Affiliation: | 1. Chair of Management and Logistics, Technische Universität Darmstadt, Hochschulstr. 1, Darmstadt 64289, Germany;2. Faculty of Business and Economics, Technische Universität Dresden, Münchner Platz 1/3, Dresden 01062, Germany |
| |
| Abstract: | Algorithms are presented in this paper for VLSI layout of come binary tree structures. In particular, we consider X-Tree and Hypertree multicomputers and show that they can be laid out in O(8n) and O(n√n) area respectively. Our algorithms are based on an original algorithm proposed by Horowitz and Zorat for an arbitrary tree structure. The layout follows Thompson's VLSI model of computation that allows two layers of metalization. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
