Paper Info
Title
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.
Year
DOI
Venue
2011
10.1007/978-3-642-29737-3_47
international conference on parallel processing
Keywords
Field
DocType
performance analysis,genetic approach,acyclic graph,communication cost,communication time,genetic algorithm,maximum completion time,service oriented architecture,grid host,communication link
Communication link,Job shop scheduling,Computer science,Scheduling (computing),Parallel computing,Directed acyclic graph,Workflow,Genetic algorithm,Grid,Service-oriented architecture,Distributed computing
Conference
Volume
ISSN
Citations 
7155
0302-9743
0
PageRank 
References 
Authors
0.34
17
3
Name
Order
Citations
PageRank
Jean-Marc Nicod19518.10
Laurent Philippe27112.95
Lamiel Toch3132.40