Comparison of Batch Scheduling for Identical Multi-Tasks Jobs on Heterogeneous Platforms - Archive ouverte HAL Access content directly
Conference Papers Year : 2008

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.
Fichier principal
Vignette du fichier
dnp08_ip.pdf (241.39 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-00563285 , version 1 (04-02-2011)

Identifiers

  • HAL Id : hal-00563285 , version 1

Cite

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. ⟨hal-00563285⟩
49 View
124 Download

Share

Gmail Mastodon Facebook X LinkedIn More