A Genetic Algorithm to Schedule Workflow Collections on a SOA-Grid with Communication Costs - Archive ouverte HAL Access content directly
Conference Papers Year : 2011

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

Dates and versions

hal-01222473 , version 1 (30-10-2015)

Identifiers

  • HAL Id : hal-01222473 , version 1

Cite

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⟩
69 View
33 Download

Share

Gmail Facebook Twitter LinkedIn More