Optimal scheduling workflows in cloud computing environment using Pareto‐based Grey Wolf Optimizer

A workflow consists of dependent tasks, and scheduling of a workflow in a cloud environment means the arrangement of tasks of the workflow on virtual machines (VMs) of the cloud. By increasing VMs and the diversity of task size, we have a huge number of such arrangements. Finding an arrangement with minimum completion time among all of the arrangements is an Non‐Polynomial‐hard problem. Moreover, the problem becomes more complex when a scheduling should consider a couple of conflicting objectives. Therefore, the heuristic algorithms have been paid attention to figure out an optimal scheduling. This means that although the single‐objective optimization, ie, minimizing completion time, proposes the workflow scheduling as an NP‐complete problem, multiobjective optimization for the scheduling problem is confronted with a more permutation space because an optimal trade‐off between the conflicting objectives is needed. To this end, we extended a recent heuristic algorithm called Grey Wolf Optimizer (GWO) and considered dependency graph of workflow tasks. Our experiment was carried out using the WorkflowSim simulator, and the results were compared with those of 2 other heuristic task scheduling algorithms.

[1]  Ewa Deelman,et al.  WorkflowSim: A toolkit for simulating scientific workflows in distributed environments , 2012, 2012 IEEE 8th International Conference on E-Science.

[2]  Radu Prodan,et al.  A Multi-objective Approach for Workflow Scheduling in Heterogeneous Environments , 2012, 2012 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (ccgrid 2012).

[3]  Daniel A. R. Chaves,et al.  A performance comparison of multi-objective optimization evolutionary algorithms for all-optical networks design , 2011, 2011 IEEE Symposium on Computational Intelligence in Multicriteria Decision-Making (MDCM).

[4]  F.J. Von Zuben,et al.  Makespan minimization on parallel processors: an immune-based approach , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[5]  Derya Eren Akyol,et al.  Minimizing Makespan on Identical Parallel Machines Using Neural Networks , 2006, ICONIP.

[6]  Guimin Chen,et al.  A Particle Swarm Optimizer with Multi-stage Linearly-Decreasing Inertia Weight , 2009, 2009 International Joint Conference on Computational Sciences and Optimization.

[7]  Xiao Liu,et al.  A Revised Discrete Particle Swarm Optimization for Cloud Workflow Scheduling , 2010, 2010 International Conference on Computational Intelligence and Security.

[8]  Rajkumar Buyya,et al.  Scheduling scientific workflow applications with deadline and budget constraints using genetic algorithms , 2006, Sci. Program..

[9]  Seyed Morteza Babamir,et al.  Makespan improvement of PSO-based dynamic scheduling in cloud environment , 2015, 2015 23rd Iranian Conference on Electrical Engineering.

[10]  Rajkumar Buyya,et al.  Multiobjective differential evolution for scheduling workflow applications on global Grids , 2009, Concurr. Comput. Pract. Exp..

[11]  Antonio J. Nebro,et al.  jMetal: A Java framework for multi-objective optimization , 2011, Adv. Eng. Softw..

[12]  Rajkumar Buyya,et al.  A Particle Swarm Optimization-Based Heuristic for Scheduling Workflow Applications in Cloud Computing Environments , 2010, 2010 24th IEEE International Conference on Advanced Information Networking and Applications.

[13]  Farookh Khadeer Hussain,et al.  Evolutionary algorithm-based multi-objective task scheduling optimization model in cloud environments , 2015, World Wide Web.

[14]  Andrew Lewis,et al.  Grey Wolf Optimizer , 2014, Adv. Eng. Softw..

[15]  Yue Shi,et al.  A modified particle swarm optimizer , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[16]  Mehmet Fatih Tasgetiren,et al.  A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem , 2007, Eur. J. Oper. Res..

[17]  Luca Maria Gambardella,et al.  A survey on metaheuristics for stochastic combinatorial optimization , 2009, Natural Computing.

[18]  Rajkumar Buyya,et al.  CloudSim: a toolkit for modeling and simulation of cloud computing environments and evaluation of resource provisioning algorithms , 2011, Softw. Pract. Exp..

[19]  Yuehui Chen,et al.  A Task Scheduling Algorithm Based on PSO for Grid Computing , 2008 .

[20]  Berit Johannes,et al.  Scheduling parallel jobs to minimize the makespan , 2006, J. Sched..

[21]  R. Buyya,et al.  A budget constrained scheduling of workflow applications on utility Grids using genetic algorithms , 2006, 2006 Workshop on Workflows in Support of Large-Scale Science.

[22]  Rajkumar Buyya,et al.  Multi-objective planning for workflow execution on Grids , 2007, 2007 8th IEEE/ACM International Conference on Grid Computing.

[23]  Yaochu Jin,et al.  A Critical Survey of Performance Indices for Multi-Objective Optimisation , 2003 .

[24]  Marco Laumanns,et al.  A Tutorial on Evolutionary Multiobjective Optimization , 2004, Metaheuristics for Multiobjective Optimisation.

[25]  Marco Laumanns,et al.  SPEA2: Improving the strength pareto evolutionary algorithm , 2001 .

[26]  A. Barron,et al.  Approximation and learning by greedy algorithms , 2008, 0803.1718.

[27]  Lothar Thiele,et al.  An evolutionary algorithm for multiobjective optimization: the strength Pareto approach , 1998 .

[28]  Jyh-Horng Chou,et al.  Optimized task scheduling and resource allocation on cloud computing environment using improved differential evolution algorithm , 2013, Comput. Oper. Res..