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.
Liste complète des métadonnées

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

https://hal.archives-ouvertes.fr/hal-00738508
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

Fichier

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

Identifiants

  • HAL Id : hal-00738508, version 1

Collections

Citation

Marin Bougeret, Pierre-Francois Dutot, Klaus Jansen, Christina Robenek, Denis Trystram. Scheduling jobs on heterogeneous platforms. COCOON, 2011, Dallas, United States. 2011, 〈http://theory.utdallas.edu/COCOON11/accepted-papers.html〉. 〈hal-00738508〉

Partager

Métriques

Consultations de
la notice

248

Téléchargements du document

128