STEADY-STATE SCHEDULING ON HETEROGENEOUS CLUSTERS
Olivier D.E. Beaumont, Arnaud Legrand, Loris Marchal, Yves Robert · International Journal of Foundations of Computer Science · 2005
This paper considers steady-state scheduling techniques for heterogeneous systems, such as clusters and grids. The use of steady-state scheduling is advocated to solve a variety of important problems, which would be too difficult to tackle with the objective of makespan minimization. Several examples are given, namely master-slave tasking, mixed task and data parallelism, and pipelined macro-communications (scatter, broadcast, multicast). For each example, both the advantages and the limitations of the approach are discussed.