Scheduling jobs on heterogeneous platforms

Abstract : In the context of grid scheduling we consider a scheduling scenario, where parallel jobs have to be scheduled non-preemptively on heterogeneous computational platforms of processors. The speed of the processors may differ among the platforms and the jobs are submitted si- multaneously or over the time and cannot run across multiple platforms. We focus on the target of minimizing the total makespan, i.e. the global latest finishing time of a job. In this paper we present an AFPTAS for the problem without release times and show how to generalize our result to malleable jobs and jobs with release times.
Type de document :
Communication dans un congrès
COCOON, 2011, Dallas, United States. 2011, <>
Liste complète des métadonnées
Contributeur : Marin Bougeret <>
Soumis le : jeudi 4 octobre 2012 - 14:34:32
Dernière modification le : mardi 15 novembre 2016 - 01:05:16
Document(s) archivé(s) le : samedi 5 janvier 2013 - 03:59:28


Fichiers produits par l'(les) auteur(s)


  • HAL Id : hal-00738508, version 1



Marin Bougeret, Pierre-Francois Dutot, Klaus Jansen, Christina Robenek, Denis Trystram. Scheduling jobs on heterogeneous platforms. COCOON, 2011, Dallas, United States. 2011, <>. <hal-00738508>



Consultations de
la notice


Téléchargements du document