This Article 
 Bibliographic References 
 Add to: 
On-Line Task Migration in Hypercubes Through Double Disjoint Paths
March 1997 (vol. 46 no. 3)
pp. 379-384

Abstract—Repeated subcube allocation and deallocation in hypercubes tend to cause fragmentation, which can be taken care of by task migration. Earlier task migration dealt with the establishment of a single path from each participating node for transmitting migrated information. The time required for migration with single paths is long, if a large amount of information is moved in hypercubes. This paper considers speedy task migration in that two disjoint paths are created between every pair of corresponding nodes for delivering migrated information simultaneously, reducing the size of data transmitted over a path. All migration paths selected are pairwise disjoint and contain no link of active subcubes, so that task migration can be performed quickly and on-line without interrupting the execution of other jobs. Our approach could lead to a considerable savings in the migration time for contemporary hypercube systems, where circuit switching or wormhole routing is implemented.

[1] T. Schwederski, H.J. Siegel, and T.L. Casavant, "Task Migration Transfers in Multistage Cube Based Parallel Systems," Proc. 1989 Int'l Conf. Parallel Processing, vol. I, pp. 296-305, Aug. 1989.
[2] M.S. Chen and K.G. Shin, "Task Migration in Hypercube Multiprocessors," Proc. 16th Int'l Symp. Computer Architecture, pp. 105-111, May 1989.
[3] 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.
[4] O. Frieder et al., "Experimentation with Hypercube Database Engines," IEEE Micro, pp. 42-56, Feb. 1992.
[5] 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.
[6] 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.
[7] P. Krueger, T.H. Lai, and V.A. Radiya, “Job Scheduling Is More Important than Processor Allocation for Hypercube Computers,” IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 5, pp. 488-497, May 1994.
[8] N.-F. Tzeng and H.-L. Chen, "On-Line Task Migration in Hypercubes Through Double Disjoint Paths," Technical Report TR-95-8-3, Center for Advanced Computer Studies, Univ. of Southwestern Louisiana, 1995.

Index Terms:
Disjoint paths, fragmentation, hypercubes, subcubes, task migration.
Hsing-Lung Chen, Nian-Feng Tzeng, "On-Line Task Migration in Hypercubes Through Double Disjoint Paths," IEEE Transactions on Computers, vol. 46, no. 3, pp. 379-384, March 1997, doi:10.1109/12.580437
Usage of this product signifies your acceptance of the Terms of Use.