A novel algorithm for buddy-subcube compaction in hypercubes

Earlier buddy-subcube compaction dealt with compacting free buddy-subcubes with the same dimension concurrently. All migration paths are pair-wise disjoint and contain no links of active subcubes, so that task migration can be performed without suspending the execution of other jobs. This paper considers quick buddy-subcube compaction in that not only do free subcubes with two adjacent dimensions be compacted concurrently, but two disjoint paths are established between every pair of source-target nodes. This approach could lead to a considerable saving in compaction time for hypercubes which support circuit switching or wormhole routing.