A Genetic Algorithm with Communication Costs to Schedule Workflows on a SOA-Grid

Abstract : In this paper we study the problem of scheduling a collection of workflows, identical or not, on a SOA (Service Oriented Architecture) grid . A workflow (job) is represented by a directed acyclic graph (DAG) with typed tasks. All of the grid hosts are able to process a set of typed tasks with unrelated processing costs and are able to transmit files through communication links for which the communication times are not negligible. The goal of our study is to minimize the maximum completion time (makespan) of the workflows. To solve this problem we propose a genetic approach. The contributions of this paper are both the design of a Genetic Algorithm taking the communication costs into account and its performance analysis.
Type de document :
Communication dans un congrès
HeteroPar'2011 - 9th International Workshop on Algorithms, Models and Tools, Sep 2011, Bordeaux, France. 2011
Liste complète des métadonnées

https://hal.inria.fr/hal-00786234
Contributeur : Equipe Roma <>
Soumis le : vendredi 8 février 2013 - 10:38:14
Dernière modification le : vendredi 20 avril 2018 - 15:44:24

Identifiants

  • HAL Id : hal-00786234, version 1

Citation

Jean-Marc Nicod, Laurent Philippe, Toch Lamiel. A Genetic Algorithm with Communication Costs to Schedule Workflows on a SOA-Grid. HeteroPar'2011 - 9th International Workshop on Algorithms, Models and Tools, Sep 2011, Bordeaux, France. 2011. 〈hal-00786234〉

Partager

Métriques

Consultations de la notice

104