Workflow Scheduling in Cloud Computing Environment by Combining Particle Swarm Optimization and Grey Wolf Optimization

Divya Makhija, P. B. Reddy, Ch. Sudhakar, V. Kumari
{"title":"Workflow Scheduling in Cloud Computing Environment by Combining Particle Swarm Optimization and Grey Wolf Optimization","authors":"Divya Makhija, P. B. Reddy, Ch. Sudhakar, V. Kumari","doi":"10.5121/cseij.2022.12601","DOIUrl":null,"url":null,"abstract":"Scheduling workflows is a vital challenge in cloud computing due to its NP-complete nature and if an efficient workflow task scheduling algorithm is not used then it affects the system’s overall performance. Therefore, there is a need for an efficient workflow task scheduling algorithm that can distribute dependent tasks to virtual machines efficiently. In this paper, a hybrid workflow task scheduling algorithm based on a combination of Particle Swarm Optimization and Grey Wolf Optimization (PSO GWO) algorithms, is proposed. PSO GWO overcomes the disadvantages of both PSO and GWO algorithms by improving the exploitation (local search) of PSO algorithm and exploration (global search) of GWO algorithm. This leads to better balance between exploration and exploitation, consequently it minimizes the makespan with 5.52% compared to GWO and 3.68% compared to PSO. The degree of imbalance reduced upto 33.22% compared to GWO and 17.61% compared to PSO, improves the convergence rate as well depending on number tasks and iterations. CloudSim tool is used to evaluate the proposed algorithm. The simulation results confirmed that the proposed method performs better than both of the standard PSO and GWO in terms of makespan, degree of imbalance and convergence rate","PeriodicalId":361871,"journal":{"name":"Computer Science & Engineering: An International Journal","volume":"97 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Science & Engineering: An International Journal","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5121/cseij.2022.12601","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Scheduling workflows is a vital challenge in cloud computing due to its NP-complete nature and if an efficient workflow task scheduling algorithm is not used then it affects the system’s overall performance. Therefore, there is a need for an efficient workflow task scheduling algorithm that can distribute dependent tasks to virtual machines efficiently. In this paper, a hybrid workflow task scheduling algorithm based on a combination of Particle Swarm Optimization and Grey Wolf Optimization (PSO GWO) algorithms, is proposed. PSO GWO overcomes the disadvantages of both PSO and GWO algorithms by improving the exploitation (local search) of PSO algorithm and exploration (global search) of GWO algorithm. This leads to better balance between exploration and exploitation, consequently it minimizes the makespan with 5.52% compared to GWO and 3.68% compared to PSO. The degree of imbalance reduced upto 33.22% compared to GWO and 17.61% compared to PSO, improves the convergence rate as well depending on number tasks and iterations. CloudSim tool is used to evaluate the proposed algorithm. The simulation results confirmed that the proposed method performs better than both of the standard PSO and GWO in terms of makespan, degree of imbalance and convergence rate
结合粒子群优化和灰狼优化的云计算环境下工作流调度
由于工作流的np完备性,工作流调度是云计算中的一个重要挑战,如果不使用有效的工作流任务调度算法,则会影响系统的整体性能。因此,需要一种高效的工作流任务调度算法,将相关任务高效地分配给虚拟机。提出了一种结合粒子群优化和灰狼优化(PSO - GWO)算法的混合工作流任务调度算法。PSO - GWO通过改进PSO算法的开发(局部搜索)和GWO算法的探索(全局搜索),克服了PSO算法和GWO算法的缺点。这可以更好地平衡勘探和开采,因此与GWO相比,它的最大完工时间为5.52%,与PSO相比为3.68%。与GWO相比,不平衡程度降低了33.22%,与PSO相比降低了17.61%,并且根据任务数和迭代次数提高了收敛速度。使用CloudSim工具对提出的算法进行评估。仿真结果表明,该方法在makespan、不平衡度和收敛速度方面均优于标准粒子群算法和GWO算法
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信