Embedding Tree Structures in VLSI Hexagonal Arrays

Authors:
Dan Gordon;Israel Koren;Gabriel M. Silberman
Affiliations:
Department of Computer Studies, University of Haifa, Haifa, 32000, Israel.;Department of Electrical Engineering, Technion-Israel Institute of Technology, Haifa, 32000, Israel.;Department of Computer Science, Technion-Israel Institute of Technology, Haifa, 32000, Israel.
Venue:
IEEE Transactions on Computers
Year:
1984

Citing 5
Cited 1

Introduction to VLSI Systems

Introduction to VLSI Systems
A reconfigurable and fault-tolerant VLSI multiprocessor array

ISCA '81 Proceedings of the 8th annual symposium on Computer Architecture
Design considerations for the VLSI processor of X-TREE

ISCA '79 Proceedings of the 6th annual symposium on Computer architecture
The Binary Tree as an Interconnection Network: Applications to Multiprocessor Systems and VLSI

IEEE Transactions on Computers
Introduction to the Configurable, Highly Parallel Computer

Computer

Efficient embeddings of binary trees in VLSI arrays

IEEE Transactions on Computers

Quantified Score

Hi-index	14.98

Visualization

Abstract

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