In this paper, we consider steady-state scheduling techniques for heterogeneous systems, such as clusters and grids. We advocate the use of steady-state scheduling to solve a variety of important problems, which would be too difficult to tackle with the objective of makespan minimization. We give a few successful examples before discussing the main limitations of the approach.
Citation:
O. Beaumont, A. Legrand, L. Marchal, Y. Robert, "Steady-State Scheduling on Heterogeneous Clusters: Why and How?," ipdps, vol. 8, pp.171a, 18th International Parallel and Distributed Processing Symposium (IPDPS'04) - Workshop 7, 2004