Speedy Task Migration in Hypercube Systems

Abstract

This article 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 and thus the migration time. All migration paths selected are pairwise disjoint and contain no link of active subcubes, so that task migration can be performed quickly and without interrupting the execution of other jobs.