Embedding Tree Structures in VLSI Hexagonal Arrays

Dan Gordon, Israel Koren, Gabriel M. Silberman

Research output: Contribution to journalArticlepeer-review


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).

Original languageEnglish
Pages (from-to)104-107
Number of pages4
JournalIEEE Transactions on Computers
Issue number1
StatePublished - Jan 1984


  • Distributed configuration algorithm
  • hexagonal multiprocessor array
  • mapping scheme
  • tree structures VLSI

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture
  • Computational Theory and Mathematics


Dive into the research topics of 'Embedding Tree Structures in VLSI Hexagonal Arrays'. Together they form a unique fingerprint.

Cite this