Issue No.01 - January (1998 vol.9)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.655243
<p><b>Abstract</b>—Compaction relocates active subcubes in a fragmented hypercube so as to produce a contiguous free region and eliminate the adverse impact of fragmentation on performance. The overhead of compaction is often contributed primarily by task migration, which makes use of disjoint paths for transmitting migrated data. Since task migration usually involves transmitting a large amount of data, the time required for migration with single paths is long, making compaction an undesirably lengthy process. This paper considers fast compaction through the use of <it>all</it> disjoint paths in existence for migration simultaneously from a source subcube to its target subcube, effectively reducing the size of data transmitted over a path and shortening the migration time. This approach leads to considerable savings in the compaction time for hypercubes which support circuit switching or wormhole routing, when compared with that using single migration paths.</p>
Compaction, disjoint paths, fragmentation, hypercubes, subcubes, task migration.
Nian-Feng Tzeng, Hsing-Lung Chen, "Fast Compaction in Hypercubes", IEEE Transactions on Parallel & Distributed Systems, vol.9, no. 1, pp. 50-56, January 1998, doi:10.1109/71.655243