Issue No. 06 - June (1991 vol. 40)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.90250
<p>The authors formalize the problem of minimizing the length of the longest interprocessor wire as the problem of embedding the processors of a hypercube onto a rectangular mesh, so as to minimize the length of longest wire. Where neighboring nodes of the mesh are taken as being at unit distance from one another, and where wires are constrained to be laid out as horizontal and vertical wires, the length of the wire joining nodes u and v of the mesh equals the graph-theoretic distance between u and v. The problem of minimizing delays due to interprocessor communication is then modeled as the problem of embedding the vertices of a hypercube onto the nodes of a mesh, so as to minimize dilation. Two embeddings which achieve dilations that (for large n) are within 26% of the lower bound for square meshes and within 12% for meshes with aspect ratio 2 are presented.</p>
processors embedding; minimizing; longest interprocessor wire; hypercube; rectangular mesh; neighboring nodes; graph-theoretic distance; delays; delays; graph theory; hypercube networks; minimisation of switching nets.
A. Sprague and T. Lai, "Placement of the Processors of a Hypercube," in IEEE Transactions on Computers, vol. 40, no. , pp. 714-722, 1991.