Cost optimal scheduling in IaaS for dependent workload with particle swarm optimization
Journal article
Authors/Editors
Strategic Research Themes
No matching items found.
Publication Details
Author list: Netjinda N., Sirinaovakul B., Achalakul T.
Publisher: Springer
Publication year: 2014
Journal: Journal of Supercomputing (0920-8542)
Volume number: 68
Issue number: 3
Start page: 1579
End page: 1603
Number of pages: 25
ISSN: 0920-8542
eISSN: 1573-0484
Languages: English-Great Britain (EN-GB)
View in Web of Science | View on publisher site | View citing articles in Web of Science
Abstract
Optimizing cloud provisioning for scientificworkflowapplications is a challenging problem, since the workflows generally contain dependency between tasks and require specific deadlines. Usually, cloud providers offer many options to the consumers. These options include the number of virtual machines, the type of each virtual machine and the purchasing method for each machine. Currently, cloud provisioning cost optimization is an active research topic. Most of this literature is concerned with task scheduling, cloud option selection, and cloud option selection for scientific workflow applications. However, research that attempts to find solutions which cover both cloud option selection and workflow task scheduling is very limited. In this paper, we focus on optimizing the cost of purchasing infrastructure-as-a-service cloud capabilities to achieve scientific work flow execution within the specific deadlines. The proposed system considers the number of purchased instances, instance types, purchasing options, and task scheduling as constraints in an optimization process. Particle swarm optimization augmented with a variable neighborhood search technique is used to find the optimal solution. Our approach finds the configurations of purchasing options with the optimum budget for a specified workflow application based on the required performance. The solutions from the proposed system show promising performance from the perspectives of the total cost and fitness convergence when compared with other state-of-the-art algorithms. ฉ Springer Science+Business Media New York 2014.
Keywords
Cost optimization, Deadline constraint, Variable neighborhood search
Contact Information