Next Article in Journal / Special Issue
A Generic Two-Phase Stochastic Variable Neighborhood Approach for Effectively Solving the Nurse Rostering Problem
Previous Article in Journal / Special Issue
Solving University Course Timetabling Problems Using Constriction Particle Swarm Optimization with Local Search
Algorithms 2013, 6(2), 245-277; doi:10.3390/a6020245
Article

Fast Rescheduling of Multiple Workflows to Constrained Heterogeneous Resources Using Multi-Criteria Memetic Computing

1,* , 1
,
1
,
2
,
1
 and
1
1 Karlsruhe Institute of Technology (KIT), Institute of Applied Computer Science (IAI), P.O. Box 3640, Karlsruhe 76021, Germany 2 Department of Computer Science, University of Applied Sciences Mannheim, Paul-Wittsack-Str. 10, Mannheim 68163, Germany
* Author to whom correspondence should be addressed.
Received: 14 January 2013 / Revised: 20 March 2013 / Accepted: 8 April 2013 / Published: 22 April 2013
Download PDF [1247 KB, uploaded 22 April 2013]

Abstract

This paper is motivated by, but not limited to, the task of scheduling jobs organized in workflows to a computational grid. Due to the dynamic nature of grid computing, more or less permanent replanning is required so that only very limited time is available to come up with a revised plan. To meet the requirements of both users and resource owners, a multi-objective optimization comprising execution time and costs is needed. This paper summarizes our work over the last six years in this field, and reports new results obtained by the combination of heuristics and evolutionary search in an adaptive Memetic Algorithm. We will show how different heuristics contribute to solving varying replanning scenarios and investigate the question of the maximum manageable work load for a grid of growing size starting with a load of 200 jobs and 20 resources up to 7000 jobs and 700 resources. Furthermore, the effect of four different local searchers incorporated into the evolutionary search is studied. We will also report briefly on approaches that failed within the short time frame given for planning.
Keywords: scheduling; Memetic Algorithms; multi-criteria optimization; constrained resources; workflow scheduling; fast scheduling; empirical study scheduling; Memetic Algorithms; multi-criteria optimization; constrained resources; workflow scheduling; fast scheduling; empirical study
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Share & Cite This Article

Further Mendeley | CiteULike
Export to BibTeX |
EndNote
MDPI and ACS Style

Jakob, W.; Strack, S.; Quinte, A.; Bengel, G.; Stucky, K.-U.; Süß, W. Fast Rescheduling of Multiple Workflows to Constrained Heterogeneous Resources Using Multi-Criteria Memetic Computing. Algorithms 2013, 6, 245-277.

View more citation formats

Article Metrics

For more information on the journal, click here

Comments

Cited By

[Return to top]
Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert