GLB: A Low-Cost Scheduling Algorithm for Distributed-Memory Architectures

Authors:
Andrei Radulescu;Arjan J. C. Van Gemund
Affiliations:
-;-
Venue:
HIPC '98 Proceedings of the Fifth International Conference on High Performance Computing
Year:
1998

Citing 0
Cited 1

A dynamic job grouping-based scheduling for deploying applications with fine-grained tasks on global grids

ACSW Frontiers '05 Proceedings of the 2005 Australasian workshop on Grid computing and e-research - Volume 44

Quantified Score

Hi-index	0.00

Visualization

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.