Comparison of Batch Scheduling for Identical Multi-Tasks Jobs on Heterogeneous Platforms

Abstract : In this paper we consider the scheduling of a batch of the same job on a heterogeneous execution platform. A job is represented by a directed acyclic graph without forks (intree) but with typed tasks. The execution resources are distributed and each resource can carry out a set of task types. The objective function is to minimize the makespan of the batch execution. Three algorithms are studied in this context: an on-line algorithm, a genetic algorithm and a steady-state algorithm. The contribution of this paper is on the experimental analysis of these algorithms and on their adaptation to the context. We show that their performances depend on the size of the batch and on the characteristics of the execution platform.
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00563285
Contributor : Jean-Michel Caricand <>
Submitted on : Friday, February 4, 2011 - 3:37:15 PM
Last modification on : Friday, July 6, 2018 - 3:06:08 PM
Document(s) archivé(s) le : Tuesday, November 6, 2012 - 1:26:39 PM

File

dnp08_ip.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00563285, version 1

Citation

Sékou Diakité, Jean-Marc Nicod, Laurent Philippe. Comparison of Batch Scheduling for Identical Multi-Tasks Jobs on Heterogeneous Platforms. PDP 2008, 16th Euromicro Int. Conf. on Parallel, Distributed and network-based Processing, 2008, France. pp.374--378, 2008. 〈hal-00563285〉

Share

Metrics

Record views

105

Files downloads

80