Communications of the ACM
Introduction to VLSI Systems
Fundamentals of Computer Alori
Fundamentals of Computer Alori
Simulation experiments of a tree organized multicomputer
ISCA '79 Proceedings of the 6th annual symposium on Computer architecture
X-Tree: A tree structured multi-processor computer architecture
ISCA '78 Proceedings of the 5th annual symposium on Computer architecture
An Array Layout Methodology for VLSI Circuits
IEEE Transactions on Computers
Evaluation of On-Chip Static Interconnection Networks
IEEE Transactions on Computers
Efficient embeddings of binary trees in VLSI arrays
IEEE Transactions on Computers
On group graphs and their fault tolerance
IEEE Transactions on Computers
Reconfigurable Tree Architectures Using Subtree Oriented Fault Tolerance
IEEE Transactions on Computers
On an Optimally Fault-Tolerant Multiprocessor Network Architecture
IEEE Transactions on Computers
Hypernet: A communication-efficient architecture for constructing massively parallel computers
IEEE Transactions on Computers
Flexible oblivious router architecture
IBM Journal of Research and Development
IEEE Transactions on Computers
An Improved Distribution Algorithm for Shortest Paths Problem
IEEE Transactions on Computers
Packet Switching Networks for Multiprocessors and Data Flow Computers
IEEE Transactions on Computers
Embedding Tree Structures in VLSI Hexagonal Arrays
IEEE Transactions on Computers
| Hi-index | 15.01 |
The binary tree is a natural way to organize complex computations by a computer. For problems that can be naturally divided into a tree structure, a great deal of parallelism may be employed. In this paper we examine several aspects of the binary tree structure as it relates to both multiprocessor systems and to VISI circuit design. First, we present an algorithm for mapping an arbitrary binary tree onto the plane. An analysis shows the density of this mapping. Second, we consider the problem of routing messages within a binary tree under the assumption that certain nodes may be faulty. Finally, we analyze the binary tree's capacity to transfer information between nodes and we compare it to the capacity of the linear array and the grid.