A novel algorithm for buddy-subcube compaction in hypercubes

Author

Chen, Hsing-Lung ; Hu, Shu-Hua

Author_Institution

Dept. of Electron. Eng., Nat. Taiwan Inst. of Technol., Taipei, Taiwan

Volume

3

fYear

1996

fDate

12-16 Aug 1996

Firstpage

207

Abstract

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

Keywords

hypercube networks; processor scheduling; buddy-subcube compaction; circuit switching; compaction time; hypercubes; migration paths; source-target nodes; wormhole routing; Assembly; Communication switching; Compaction; Data engineering; Educational institutions; Hypercubes; Job design; Parallel processing; Routing; Switching circuits;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel Processing, 1996. Vol.3. Software., Proceedings of the 1996 International Conference on

Conference_Location

Ithaca, NY

ISSN

0190-3918

Print_ISBN

0-8186-7623-X

Type

conf

DOI

10.1109/ICPP.1996.538577

Filename

538577