This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
The Binary Tree as an Interconnection Network: Applications to Multiprocessor Systems and VLSI
April 1981 (vol. 30 no. 4)
pp. 247-253
E. Horowitz, Department of Computer Science and Electrical Engineering, University of Southern California
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.
Index Terms:
VLSI, Binary trees, multiprocessing, networks, parallelism
Citation:
E. Horowitz, A. Zorat, "The Binary Tree as an Interconnection Network: Applications to Multiprocessor Systems and VLSI," IEEE Transactions on Computers, vol. 30, no. 4, pp. 247-253, April 1981, doi:10.1109/TC.1981.1675772
Usage of this product signifies your acceptance of the Terms of Use.