An effective multi-objective workflow scheduling in cloud computing: A PSO based approach

Shubham, Rishabh Gupta, Vatsal Gajera, P. K. Jana
{"title":"An effective multi-objective workflow scheduling in cloud computing: A PSO based approach","authors":"Shubham, Rishabh Gupta, Vatsal Gajera, P. K. Jana","doi":"10.1109/IC3.2016.7880196","DOIUrl":null,"url":null,"abstract":"Cloud computing has emerged as prominent paradigm in distributed computing which provides on-demand services to users. It involves challenging areas like workflow scheduling to decide the sequence in which the applications are to be scheduled on several computing resources. Due to NP-complete nature of workflow scheduling, finding an optimal solution is very challenging task. Thus, a meta-heuristic approach such as Particle Swarm Optimization (PSO) can be a promising technique to obtain a near-optimal solution of this problem. Several workflow scheduling algorithms have been developed in recent years but quite a few of them focuses on two or more parameters of scheduling at a time like usage cost, makespan, utilization of resource, load balancing etc. In this paper, we present a PSO based workflow scheduling which consider two such conflicting parameters i.e., makespan and resource utilization. With meticulous experiments on standard workflows we find that our proposed approach outperforms genetic algorithm based workflow scheduling in all cases achieving 100% results.","PeriodicalId":294210,"journal":{"name":"2016 Ninth International Conference on Contemporary Computing (IC3)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"21","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 Ninth International Conference on Contemporary Computing (IC3)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IC3.2016.7880196","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 21

Abstract

Cloud computing has emerged as prominent paradigm in distributed computing which provides on-demand services to users. It involves challenging areas like workflow scheduling to decide the sequence in which the applications are to be scheduled on several computing resources. Due to NP-complete nature of workflow scheduling, finding an optimal solution is very challenging task. Thus, a meta-heuristic approach such as Particle Swarm Optimization (PSO) can be a promising technique to obtain a near-optimal solution of this problem. Several workflow scheduling algorithms have been developed in recent years but quite a few of them focuses on two or more parameters of scheduling at a time like usage cost, makespan, utilization of resource, load balancing etc. In this paper, we present a PSO based workflow scheduling which consider two such conflicting parameters i.e., makespan and resource utilization. With meticulous experiments on standard workflows we find that our proposed approach outperforms genetic algorithm based workflow scheduling in all cases achieving 100% results.
云计算中有效的多目标工作流调度:一种基于粒子群算法的方法
云计算已经成为分布式计算的重要范例,它为用户提供按需服务。它涉及到一些具有挑战性的领域,比如工作流调度,以决定在几个计算资源上调度应用程序的顺序。由于工作流调度的np完全特性,寻找最优解是一项非常具有挑战性的任务。因此,粒子群优化(PSO)等元启发式方法有望获得该问题的近最优解。近年来已经开发了几种工作流调度算法,但相当多的算法都集中在一次调度的两个或多个参数上,如使用成本、完工时间、资源利用率、负载平衡等。本文提出了一种基于粒子群算法的工作流调度方法,该方法考虑了最大完工时间和资源利用率这两个相互冲突的参数。通过对标准工作流的细致实验,我们发现我们提出的方法在所有情况下都优于基于遗传算法的工作流调度,达到100%的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信