Layout area of the hypercube: (extended abstract)

Authors:
Shimon Even;Roni Kupershtok
Affiliations:
Technion - Israel Inst. of Tech., Haifa, Israel;Technion - Israel Inst. of Tech., Haifa, Israel
Venue:
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Year:
2002

Citing 6
Cited 1

Introduction to parallel algorithms and architectures: array, trees, hypercubes

Introduction to parallel algorithms and architectures: array, trees, hypercubes
Area-Efficient VLSI Layouts for Binary Hypercubes

IEEE Transactions on Computers
Efficient VLSI Layouts of Hypercubic Networks

FRONTIERS '99 Proceedings of the The 7th Symposium on the Frontiers of Massively Parallel Computation
Area-time complexity for VLSI

STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
A complexity theory for VLSI

A complexity theory for VLSI
Efficient low-degree interconnection networks for parallel processing: topologies, algorithms, vlsi layouts, and fault tolerance

Efficient low-degree interconnection networks for parallel processing: topologies, algorithms, vlsi layouts, and fault tolerance

AT2L2 o N2/2 for fast fourier transform in multilayer VLSI

Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we study the square grid area required for laying out Hl, the Boolean hypercube of N = 2l vertices. It is shown that this area is 4/9N2 + o(N2). We describe a layout which occupies this much area and prove that no layout of less area exists.