The GST load balancing algorithm for parallel and distributed systems
This paper proposes a new dynamic algorithm for the generalised load balancing problem. This new dynamic method provides a fast, efficient allocation of n interacting tasks among m processing nodes. This algorithm, the GST algorithm, is a novel and efficient method for dynamically partitioning a set of n interdependent, intercommunicating tasks, that form the parallel or distributed program, among m processing nodes connected in a given topology. The dynamic allocation uses information about the program's structure, derived at compilation time, to guide the allocation process. (C) 1998 Elsevier Science Inc. All rights reserved.
load balancing distributed systems heuristic algorithms multiprocessors parallel processors scheduling task allocation