Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.