Skip to main navigation Skip to search Skip to main content

A genetic algorithm for data-aware approximate workflow scheduling

  • F5 Networks

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Data placement in complex scientific workflows gradually attracts more attention since the large amounts of data generated by these workflows significantly increases the turnaround time of the end-to-end application. It is almost impossible to make an optimal scheduling for the end-to-end workflow without considering the intermediate data movement. In order to reduce the complexity of the workflow-scheduling problem, most of the existing work constrains the problem space by some unrealistic assumptions, which result in non-optimal scheduling in practice. In this study, we propose a genetic data-aware algorithm for the end-to-end workflow scheduling problem, which performs very close to the optimal solution.

Original languageEnglish
Title of host publication2013 International Conference on Electronics, Computer and Computation, ICECCO 2013
PublisherIEEE Computer Society
Pages322-325
Number of pages4
ISBN (Print)9781479933433
DOIs
StatePublished - 2013
Event2013 10th International Conference on Electronics, Computer and Computation, ICECCO 2013 - Ankara, Turkey
Duration: Nov 7 2013Nov 8 2013

Publication series

Name2013 International Conference on Electronics, Computer and Computation, ICECCO 2013

Conference

Conference2013 10th International Conference on Electronics, Computer and Computation, ICECCO 2013
Country/TerritoryTurkey
CityAnkara
Period11/7/1311/8/13

Keywords

  • data
  • genetic algorithm
  • Workflows

Fingerprint

Dive into the research topics of 'A genetic algorithm for data-aware approximate workflow scheduling'. Together they form a unique fingerprint.

Cite this