Issue No. 03 - March (1997 vol. 46)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.580437
<p><b>Abstract</b>—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.</p>
Disjoint paths, fragmentation, hypercubes, subcubes, task migration.
N. Tzeng and H. Chen, "On-Line Task Migration in Hypercubes Through Double Disjoint Paths," in IEEE Transactions on Computers, vol. 46, no. , pp. 379-384, 1997.