Analysis of Scheduling Algorithms with Reservations

Abstract : In this work, we analyze the problem of scheduling a set of independent jobs on a homogeneous parallel computer. This problem has been widely studied from both a theoretical perspective (complexity analysis, and predictability of scheduling algorithms) and practical side (schedulers in production systems). It is common for some processors of a cluster to become unavailable for a certain period of time corresponding to reservations. These reservations represent blocks of time and quantities of resources set asigned in advance for specific applications. We propose here to investigate the scheduling problem where there are restricted resource availabilities. Our main result is to provide a deep analysis for this problem (complexity, lower bounds and upper bounds) for several vari ants of list scheduling algorithms. More precisely, we show that the problem of scheduling with any reservations can not be approximated. This leads to the study of restricted versions of this problem where the amount of reservation is limited. Our analysis is based on an old bound of Graham for resource constraint list scheduling for which we propose a new simpler proof by considering the continuous version of this problem.
Type de document :
Communication dans un congrès
IPDPS 2007, Mar 2007, Long Beach, California, United States. IEEE, pp.1-8, 2007
Liste complète des métadonnées

Littérature citée [16 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-00186786
Contributeur : Grégory Mounié <>
Soumis le : lundi 12 novembre 2007 - 13:36:18
Dernière modification le : vendredi 21 décembre 2018 - 10:46:08
Document(s) archivé(s) le : lundi 24 septembre 2012 - 15:10:43

Fichier

reservations_ipdps.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00186786, version 1

Citation

Lionel Eyraud-Dubois, Grégory Mounié, Denis Trystram. Analysis of Scheduling Algorithms with Reservations. IPDPS 2007, Mar 2007, Long Beach, California, United States. IEEE, pp.1-8, 2007. 〈hal-00186786〉

Partager

Métriques

Consultations de la notice

533

Téléchargements de fichiers

309