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.
Document type :
Conference papers
COCOON, 2011, United States


https://hal.archives-ouvertes.fr/hal-00738508
Contributor : Marin Bougeret <>
Submitted on : Thursday, October 4, 2012 - 2:34:32 PM
Last modification on : Friday, February 6, 2015 - 3:51:26 PM

File

COCOON2011.pdf
fileSource_public_author

Identifiers

  • HAL Id : hal-00738508, version 1

Citation

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

Export

Share

Metrics

Consultation de
la notice

51

Téléchargement du document

18