Bi-criteria Algorithm for Scheduling Jobs on Cluster Platforms - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2004

Bi-criteria Algorithm for Scheduling Jobs on Cluster Platforms

Pierre-Francois Dutot
Lionel Eyraud-Dubois
Grégory Mounié
Denis Trystram

Résumé

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.
Fichier principal
Vignette du fichier
dutot_archiv.pdf (173.75 Ko) Télécharger le fichier

Dates et versions

hal-00001520 , version 1 (04-05-2004)
hal-00001520 , version 2 (22-10-2004)
hal-00001520 , version 3 (20-01-2005)

Identifiants

Citer

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. pp.125-132. ⟨hal-00001520v3⟩
287 Consultations
181 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More