Bi-criteria Algorithm for Scheduling Jobs on Cluster Platforms

Abstract : We describe in this paper a new method for building an efficient algorithm for scheduling jobs in a cluster. Jobs are considered as parallel tasks (PT) which can be scheduled on any number of processors. The main feature is to consider two criteria that are optimized together. These criteria are the makespan and the weighted minimal average completion time ( minsum). They are chosen for their complementarity, to be able to represent both user-oriented objectives and system administrator objectives. We propose an algorithm based on a batch policy with increasing batch sizes, with a smart selection of jobs in each batch. This algorithm is assessed by intensive simulation results, compared to a new lower bound (obtained by a relaxation of ILP) of the optimal schedules for both criteria separately. It is currently implemented in an actual real-size cluster platform.
Type de document :
Communication dans un congrès
ACM Symposium on Parallel Algorithms and Architectures (SPAA), 2004, France. ACM, pp.125-132, 2004
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00001520
Contributeur : Grégory Mounié <>
Soumis le : jeudi 20 janvier 2005 - 15:57:42
Dernière modification le : vendredi 21 décembre 2018 - 10:46:08
Document(s) archivé(s) le : jeudi 23 septembre 2010 - 15:30:44

Identifiants

Collections

INRIA | IMAG | UGA

Citation

Pierre-Francois Dutot, Lionel Eyraud-Dubois, Grégory Mounié, Denis Trystram. Bi-criteria Algorithm for Scheduling Jobs on Cluster Platforms. ACM Symposium on Parallel Algorithms and Architectures (SPAA), 2004, France. ACM, pp.125-132, 2004. 〈hal-00001520v3〉

Partager

Métriques

Consultations de la notice

423

Téléchargements de fichiers

113