• DocumentCode
    3046032
  • Title

    Steady-state scheduling on heterogeneous clusters: why and how?

  • Author

    Beaumont, O. ; Legrand, A. ; Marchal, L. ; Robert, Y.

  • Author_Institution
    LaBRI, Bordeaux, France
  • fYear
    2004
  • fDate
    26-30 April 2004
  • Firstpage
    171
  • Abstract
    Summary form only given. 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.
  • Keywords
    grid computing; minimisation; processor scheduling; workstation clusters; heterogeneous cluster; heterogeneous systems; makespan minimization; steady-state scheduling techniques; Computational complexity; Computer applications; Grid computing; Master-slave; Minimization methods; Optimal scheduling; Polynomials; Processor scheduling; Scheduling algorithm; Steady-state;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Parallel and Distributed Processing Symposium, 2004. Proceedings. 18th International
  • Print_ISBN
    0-7695-2132-0
  • Type

    conf

  • DOI
    10.1109/IPDPS.2004.1303171
  • Filename
    1303171