loading...
Steady-State Scheduling on Heterogeneous Clusters: Why and How?
Santa Fe, New Mexico April 26-April 30
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/IPDPS.2004.130317118th International Parallel and Distr ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
O. Beaumont, LaBRI, UMR CNRS
A. Legrand, LIP, UMR CNRS-INRIA
L. Marchal, LIP, UMR CNRS-INRIA
Y. Robert, LIP, UMR CNRS-INRIA
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
Usage of this product signifies your acceptance of the Terms of Use.


Suggestions