Volume 8, Issue 1 (3-2016)                   IJICTR 2016, 8(1): 51-59 | Back to browse issues page

XML Print


Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

Khalili A, Babamir S M. A Pareto-based Optimizer for Workflow Scheduling in Cloud Computing Environment . IJICTR. 2016; 8 (1) :51-59
URL: http://ijict.itrc.ac.ir/article-1-77-en.html
1- Department of Computer Engineering, University of Kashan Kashan, Iran
Abstract:   (2117 Views)
A scheduling algorithm in cloud computing environment is in charge of assigning tasks of a workflow to cloud’s virtual machines (VMs) so that the workflow completion time is minimized. Due to the heterogeneity and dynamicity of VMs and diversity of tasks size, workflow scheduling is confronted with a huge permutation space and is known as an NP-complete problem; therefore, heuristic algorithms are used to reach an optimal scheduling. While the single-objective optimization i.e., minimizing completion time, proposes the workflow scheduling as a NP-complete problem, multi-objective optimization for the scheduling problem is confronted with a more permutation space. In our pre vious work, we considered single-objective optimization (minimizing the workflow completion time) using Particle Swarm Optimization (PSO) algorithm. The current study aims to present a multi -objective optimizer for conflicting objectives using Gray Wolves Optimizer (GWO) where dependencies exist between workflow tasks. We applied our method to Epigenomics (balanced) and Montage (imbalanced) workflows and compared our results with those of the SPEA2 algorithm based on parameters of Attention Quotient, Max Extension, and Remoteness Dispersal.
Full-Text [PDF 1020 kb]   (1336 Downloads)    
Type of Study: Research | Subject: Information Technology

Add your comments about this article : Your username or Email:
CAPTCHA code