Embedding Meshes into Small Boolean Cubes
1990 (English)Conference paper (Refereed)
The embedding of arrays in Boolean cubes, when there are more array elements than nodes in the cube, can always be made with optimal load-factor by reshaping the array to a one-dimensional array. We show that the dilation for such an embedding is of an .to x .t1 x - + x &-I array in an n-cube.Dila tion one embeddings can be obtained by splitting each axis into segments and assigning segments to nodes in the cube by a Gray code. The load-factor is optimal if the axis lengths contain sufficiently many powers of two. The congestion is minimized, if the segment lengths along the different axes are as equal as possible, for the cube configured with at most as many axes as the array. A further decrease in the congestion is possible if the array is partitioned into subarrays, and corresponding axis of different subarrays make use of edge-disjoint Hamiltonian cycles within subcubes. The congestion can also be reduced by using multiple paths between pairs of cube nodes, i.e., by using “fat” edges.
Place, publisher, year, edition, pages
1990. 1366-1374 p.
Computer and Information Science
IdentifiersURN: urn:nbn:se:kth:diva-65529DOI: 10.1109/DMCC.1990.556398OAI: oai:DiVA.org:kth-65529DiVA: diva2:483421
The Fifth Distributed Memory Computing Conference
NR 201408052012-01-252012-01-25Bibliographically approved