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

Jean Nicod (1) , Laurent Philippe (1) , Lamiel Toch (1)

1 FEMTO-ST - Franche-Comté Électronique Mécanique, Thermique et Optique - Sciences et Technologies (UMR 6174)

In this paper we study the problem of scheduling a collection of workflows, identical or not, on a SOA 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 task types with unrelated processing costs and are able to transmit files through communication links for which the communication times are not negligible. The goal 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 the performance analysis.

Domaines: Réseaux et télécommunications [cs.NI]; Calcul parallèle, distribué et partagé [cs.DC]; Informatique ubiquitaire; Informatique et langage [cs.CL]

Jean Nicod, Laurent Philippe, Lamiel Toch. A Genetic Algorithm to Schedule Workflow Collections on a SOA-Grid with Communication Costs . HeteroPar'2011, 9-th Int. Workshop on Algorithms, Models and Tools for Parallel Computing on Heterogeneous Platforms, 2011, Bordeaux, France. pp.419--428. ⟨hal-01222473⟩