Dealing with structural changes on provisioning resources for deadline-constrained workflow

Cloud computing has received an increasing attention in the past years thanks to its new model of resources provisioning. One well-known challenge in this context is to make an appropriate decision when mapping tasks to resources considering multiple objectives that are often contradictory. This pro...

Full description

Saved in:
Bibliographic Details
Published in:The Journal of supercomputing 2017-07, Vol.73 (7), p.2896-2918
Main Authors: Fakhfakh, Fairouz, Kacem, Hatem Hadj, Kacem, Ahmed Hadj
Format: Article
Language:English
Subjects:
Cloud computing
Compilers
Computer Science
Heuristic methods
Interpreters
Laws
Mapping
Optimization techniques
Particle swarm optimization
Processor Architectures
Programming Languages
Provisioning
Workflow
Workflow software
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Cloud computing has received an increasing attention in the past years thanks to its new model of resources provisioning. One well-known challenge in this context is to make an appropriate decision when mapping tasks to resources considering multiple objectives that are often contradictory. This problem has become more complex, mainly for workflow applications which impose dependencies and order constraints between tasks. The resources provisioning problem for workflow applications has been widely studied in the literature. Nevertheless, the existing works consider only static workflows. They neglect the need to change workflow instances while they are being executed. This functionality has become a major requirement to deal with unusual situations and evolution. In fact, the strong competition in which companies are involved often lead them to adapt their workflows to face new regulation laws, changes in the customer behavior and some exceptional situations. In this paper, we present a new provisioning algorithm based on the meta-heuristic optimization technique, particle swarm optimization. It takes into account dynamic structural changes of a workflow, while satisfying some performance criteria defined by the user. We address general flow structures including sequential, parallel, choice and loop patterns. We conducted our experiments using CloudSim and various well-known scientific workflows of different sizes. Experimental results show that our approach has a promising performance.
ISSN:0920-8542
1573-0484
DOI:10.1007/s11227-016-1823-7