This Article 
 Bibliographic References 
 Add to: 
Fast Compaction in Hypercubes
January 1998 (vol. 9 no. 1)
pp. 50-56

Abstract—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 all 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.

[1] M.S. Chen and K.G. Shin, "Subcube Allocation and Task Migration in Hypercube Multiprocessors," IEEE Trans. Computers, vol. 39, no. 9, pp. 1,146-1,155, Sept. 1990.
[2] J. Kim, C.R. Das, and W. Lin, “A Top-Down Processor Allocation Scheme for Hypercube Computers,” IEEE Trans. Parallel and Distributed Systems, vol. 2, no. 1, pp. 20-30, Jan. 1991.
[3] P.-J. Chuang and N.-F. Tzeng,"A Fast Recognition-Complete Processor Allocation Strategy for Hypercube Computers," IEEE Trans. Computers, pp. 467-479, Apr. 1992.
[4] Q. Yang and H. Wang, "A New Graph Approach to Minimizing Processor Fragmentation in Hypercube Multiprocessors," IEEE Trans. Parallel and Distributed Systems, vol. 4, pp. 1,165-1,171, Oct. 1993.
[5] S. Rai, J.L. Trahan, and T. Smailus, "Processor Allocation in Hypercube Multiprocessors," IEEE Trans. Parallel and Distributed Systems, vol. 6, no. 6, pp. 606-616, June 1995.
[6] C. Shen, K. Ramamritham, and J.A. Stankovic, "Resource Reclaiming in Multiprocessor Real-Time Systems," IEEE Trans. Parallel and Distributed Systems, Vol. 4, No. 4, Apr. 1993, pp. 382-397.
[7] C.-H. Huang and J.-Y. Juang, "A Partial Compaction Scheme for Processor Allocation in Hypercube Multiprocessors," Proc. 1990 Int'l Conf. Parallel Processing, vol. I, pp. 211-217, Aug. 1990.
[8] G.-I. Chen and T.-H. Lai, "Constructing Parallel Paths Between Two Subcubes," IEEE Trans. Computers, vol. 41, no. 1, pp. 118-123, Jan. 1992.
[9] O. Frieder et al., "Experimentation with Hypercube Database Engines," IEEE Micro, pp. 42-56, Feb. 1992.
[10] L.M. Ni and P.K. McKinley, "A Survey of Wormhole Routing Techniques in Direct Networks," Computer, vol. 26, no. 2, pp. 62-76, Feb. 1993.
[11] P.K. McKinley and C. Trefftz, "Efficient Broadcast in All-Port Wormhole-Routing Hypercubes," Proc. 1993 Int'l Conf. Parallel Processing, vol. II, pp. 288-291, Aug. 1993.
[12] N.-F. Tzeng and H.-L. Chen, "Fast Compaction in Hypercubes," Technical Report TR-95-8-4, Center for Advanced Computer Studies, Univ. of Southwestern Louisiana, 1995.

Index Terms:
Compaction, disjoint paths, fragmentation, hypercubes, subcubes, task migration.
Nian-Feng Tzeng, Hsing-Lung Chen, "Fast Compaction in Hypercubes," IEEE Transactions on Parallel and Distributed Systems, vol. 9, no. 1, pp. 50-56, Jan. 1998, doi:10.1109/71.655243
Usage of this product signifies your acceptance of the Terms of Use.