On the Area of Hypercube Layouts
| dc.creator | Greenberg, Ronald I. | |
| dc.creator | Guan, Lee | |
| dc.date | 2001-05-29 | |
| dc.date.accessioned | 2026-07-07T03:17:10Z | |
| dc.date.available | 2026-07-07T03:17:10Z | |
| dc.description | This paper precisely analyzes the wire density and required area in standard layout styles for the hypercube. The most natural, regular layout of a hypercube of N^2 nodes in the plane, in a N x N grid arrangement, uses floor(2N/3)+1 horizontal wiring tracks for each row of nodes. (The number of tracks per row can be reduced by 1 with a less regular design.) This paper also gives a simple formula for the wire density at any cut position and a full characterization of all places where the wire density is maximized (which does not occur at the bisection). | |
| dc.description | 8 pages, 4 figures, LaTeX | |
| dc.identifier | https://arxiv.org/abs/cs/0105034 | |
| dc.identifier | http://arxiv.org/abs/cs/0105034 | |
| dc.identifier | condensed and revised in Information Processing Letters, v. 84, n. 1, pp. 41--46, Sep. 2002 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/30622 | |
| dc.subject | Distributed, Parallel, and Cluster Computing | |
| dc.subject | C.1.2 | |
| dc.title | On the Area of Hypercube Layouts | |
| dc.type | text |