Catfish-PSO based scheduling of scientific workflows in IaaS cloud

被引:0
作者
S. Jaya Nirmala
S. Mary Saira Bhanu
机构
[1] National Institute of Technology,
来源
Computing | 2016年 / 98卷
关键词
Cloud computing; Job scheduling; Catfish particle swarm optimisation; Scientific workflows; WorkFlowSim; 68M154; 685M20; 68T20; 68U20;
D O I
暂无
中图分类号
学科分类号
摘要
Cloud computing is a technology wherein a network of remote servers is used to process large amount of data in real-time. The servers and data sources may be located in geographically distant regions. Scheduling of workflows is one of the major challenging issues in cloud computing. Workflows are used to express a wide variety of applications including scientific computing and multi-tier web applications. The Workflow scheduling problem is known to be NP-complete. No known traditional scheduling algorithm is able to provide an optimal solution in polynomial time for NP-complete problems. So, researchers rely on heuristics and meta-heuristics to achieve the most efficient solution. In this paper, a workflow scheduling algorithm is proposed to schedule large scientific workflows that are to be executed on IaaS clouds. The workflow scheduling algorithm generates a schedule with the task-to-resource mapping. The metaheuristic Catfish particle swarm optimization (C-PSO) technique is used to select the best schedule with the least makespan and execution cost. The performance of C-PSO is then compared with traditional PSO. The algorithm is simulated on the WorkFlowSim Simulator, an extension of CloudSim simulator. The solution is tested for different types of scientific workflows like Montage, Epigenome, CyberShake and Inspiral. It is observed from the experimental results that C-PSO gives better performance than traditional PSO in terms of execution cost and makespan.
引用
收藏
页码:1091 / 1109
页数:18
相关论文
共 32 条
[1]  
Deelman E(2009)Grids and Clouds: making workflow applications work in heterogeneous distributed environments Int J High Perform Comput Appl 24 284-298
[2]  
Deelman E(2005)Pegasus: a framework for mapping complex scientific workflows onto distributed systems Sci Program J 13 219-237
[3]  
Singh G(2011)Optimizing the makespan and reliability for Workflow applications with reputation and a Look-Ahead GA J Future Gener Comput Syst 27 1124-1134
[4]  
Su MH(2002)Matching and scheduling algorithms for minimizing execution time and failure probability of applications in heterogeneous computing IEEE Trans Parallel Distrib Syst 13 308-323
[5]  
Wang X(2014)Multi-objective list scheduling of workflow applications in distributed computing infrastructures J Parallel Distrib Comput 74 21522165-197
[6]  
Yeob CS(2002)A fast and elitist multiobjective genetic algorithm: NSGA-II IEEE Trans Evol Comput 6 182-169
[7]  
Buyya R(2013)Deadline-constrained workflow scheduling algorithms for Infrastructure as a Service Clouds Future Gener Comput Syst 29 158-197
[8]  
Sua J(2010)An efficient hybrid approach based on PSO, ACO and k-means for cluster analysis Appl Soft Comput 10 183-124
[9]  
Dogan A(2010)A perturbed particle swarm algorithm for numerical optimization Appl Soft Comput 10 119-628
[10]  
Ozguner F(2010)Simplifying particle swarm optimization Appl Soft Comput 10 618-2540