By Topic

A novel algorithm for buddy-subcube compaction in hypercubes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Hsing-Lung Chen ; Dept. of Electron. Eng., Nat. Taiwan Inst. of Technol., Taipei, Taiwan ; Shu-Hua Hu

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

Published in:

Parallel Processing, 1996. Vol.3. Software., Proceedings of the 1996 International Conference on  (Volume:3 )

Date of Conference:

12-16 Aug 1996