This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Embedding Tree Structures in VLSI Hexagonal Arrays
January 1984 (vol. 33 no. 1)
pp. 104-107
Dan Gordon, Department of Computer Studies, University of Haifa, Haifa, 32000, Israel.
Israel Koren, Department of Electrical Engineering, Technion¿Israel Institute of Technology, Haifa, 32000, Israel.
Gabriel M. Silberman, Department of Computer Science, Technion ¿Israel Institute of Technology, Haifa, 32000, Israel.
Tree structures have been proposed for special-purpose and general-purpose multiprocessors due to their desirable property of logarithmic path from the root to any leaf element. Since only local communication among processors is needed in tree structures, they are well suited for the VLSI technology. Such an implementation requires an area-economical mapping of a tree on a plane. Novel mapping schemes for trees onto hexagonal arrays (or grids) and appropriate algorithms are proposed here and shown to be superior over known mappings on square arrays (or grids).
Citation:
Dan Gordon, Israel Koren, Gabriel M. Silberman, "Embedding Tree Structures in VLSI Hexagonal Arrays," IEEE Transactions on Computers, vol. 33, no. 1, pp. 104-107, Jan. 1984, doi:10.1109/TC.1984.5009319
Usage of this product signifies your acceptance of the Terms of Use.