A layout strategy for VLSI which is provably good (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Bounds on minimax edge length for complete binary trees
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Communication In X-TREE, A Modular Multiprocessor System
ACM '78 Proceedings of the 1978 annual conference
The tree machine: a highly concurrent computing environment
The tree machine: a highly concurrent computing environment
Area-efficient vlsi computation
Area-efficient vlsi computation
An Array Layout Methodology for VLSI Circuits
IEEE Transactions on Computers
A Probabilistic Pipeline Algorithm for K Selection on the Tree Machine
IEEE Transactions on Computers
Efficient embeddings of binary trees in VLSI arrays
IEEE Transactions on Computers
IEEE Transactions on Computers
A layout strategy for VLSI which is provably good (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
The Diogenes Approach to Testable Fault-Tolerant Arrays of Processors
IEEE Transactions on Computers
Computing solutions of the paintshop-necklace problem
Computers and Operations Research
| Hi-index | 0.01 |
Many researchers have proposed that ensembles of processing elements be organized as trees. This paper explores how large tree machines may be assembled efficiently from smaller components. A principal constraint that we consider is the limited number of external connections from an integrated circuit chip. We also explore the emerging capability of restructurable VLSI which allows a chip to be customized after fabrication. We give a linear-area chip of m processors and only four off-chip connections which can be used as the sole building block to construct an arbitrarily large complete binary tree. We also present a restructurable linear-area layout of m processors with O(lg m) pins that can realize an arbitrary binary tree. This layout is based on a solution to the graph-theoretic problem: Given a tree in which each vertex is either black or white, determine how many edges need be cut in order to bisect the tree into equal-size components, each containing exactly half the black and half the white vertices.