DocumentCode
2453429
Title
GLB: a low-cost scheduling algorithm for distributed-memory architectures
Author
Radulescu, Andrei ; Van Gemund, Arjan J C
Author_Institution
Dept. of Inf. Technol. & Syst., Delft Univ. of Technol., Netherlands
fYear
1998
fDate
17-20 Dec 1998
Firstpage
294
Lastpage
301
Abstract
This paper proposes a new compile time scheduling algorithm for distributed-memory systems, called Global Load Balancing (GLB). GLB is intended as the second step in the multi-step class of scheduling algorithms. Experimental results show that compared with known scheduling algorithms of the same low-cost complexity, the proposed algorithm improves schedule lengths up to 30%. Compared to algorithms with higher order complexities, the typical schedule lengths obtained with the proposed algorithm are at most twice longer
Keywords
computational complexity; distributed memory systems; parallel algorithms; program compilers; resource allocation; scheduling; GLB; Global Load Balancing; compile time scheduling algorithm; distributed-memory architectures; experimental results; low-cost complexity; low-cost scheduling algorithm; multi-step class; Clustering algorithms; Costs; Delay; Heuristic algorithms; Information technology; Load management; Processor scheduling; Scheduling algorithm;
fLanguage
English
Publisher
ieee
Conference_Titel
High Performance Computing, 1998. HIPC '98. 5th International Conference On
Conference_Location
Madras
Print_ISBN
0-8186-9194-8
Type
conf
DOI
10.1109/HIPC.1998.738001
Filename
738001
Link To Document