DocumentCode
3193114
Title
A load-balancing algorithm for N-cubes
Author
Wu, Min-You ; Shu, Wei
Author_Institution
Dept. of Comput. Sci., State Univ. of New York, Buffalo, NY, USA
Volume
3
fYear
1996
fDate
12-16 Aug 1996
Firstpage
148
Abstract
A parallel scheduling algorithm for N-cube networks is presented. This algorithm can fully balance the load and maximize locality by using global load information. Communication costs are significantly reduced compared to other existing algorithms
Keywords
multiprocessor interconnection networks; parallel algorithms; processor scheduling; resource allocation; N-cube networks; communication costs; global load information; load-balancing algorithm; locality; parallel scheduling algorithm; Computer science; Costs; Dynamic scheduling; Grain size; Heuristic algorithms; Load management; Optimal scheduling; Processor scheduling; Runtime; Scheduling algorithm;
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.538570
Filename
538570
Link To Document