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

Abstract : 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.
Complete list of metadatas

Cited literature [23 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01222473
Contributor : Jean-Michel Caricand <>
Submitted on : Friday, October 30, 2015 - 2:07:08 PM
Last modification on : Friday, July 6, 2018 - 3:06:09 PM
Long-term archiving on : Friday, April 28, 2017 - 8:11:19 AM

File

pnt11:ip-author.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01222473, version 1

Citation

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⟩

Share

Metrics

Record views

95

Files downloads

58