Optimizing scheduling in cloud using a meta-heuristic approach

IF 1.2 Q2 MATHEMATICS, APPLIED
S. Maheshwari, S. Shiwani, S. Choudhary
{"title":"Optimizing scheduling in cloud using a meta-heuristic approach","authors":"S. Maheshwari, S. Shiwani, S. Choudhary","doi":"10.1080/09720529.2022.2133252","DOIUrl":null,"url":null,"abstract":"Abstract Cloud computing aims to optimal use of its resources by aggregating them to increase throughput and solve difficult computational problems in the most efficient way possible. Task scheduling problem is incompliant with exact solutions in cloud due to its NP-hard nature. To address this, various meta-heuristic strategies have been developed. A task scheduler should locate the optimal resources for the user’s job while taking into account specific cloud task parameter constraints. Here, a hybrid task scheduling strategy is described that incorporates deep learning and nature-inspired meta-heuristic optimization to maximize cloud throughput while minimizing completion time in an IaaS cloud. The scheduler succeeds towards cloudlet allocation resulted to shorter makespan and higher system throughput. The novel scheduling technique was evaluated against certain algorithms using the CloudSim software. When compared to existing algorithms such as Particle Swarm Optimization (PSO) and Ant Colony Optimization (ACO), the experimental findings show that the suggested approach outperforms them.","PeriodicalId":46563,"journal":{"name":"JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY","volume":null,"pages":null},"PeriodicalIF":1.2000,"publicationDate":"2022-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/09720529.2022.2133252","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0

Abstract

Abstract Cloud computing aims to optimal use of its resources by aggregating them to increase throughput and solve difficult computational problems in the most efficient way possible. Task scheduling problem is incompliant with exact solutions in cloud due to its NP-hard nature. To address this, various meta-heuristic strategies have been developed. A task scheduler should locate the optimal resources for the user’s job while taking into account specific cloud task parameter constraints. Here, a hybrid task scheduling strategy is described that incorporates deep learning and nature-inspired meta-heuristic optimization to maximize cloud throughput while minimizing completion time in an IaaS cloud. The scheduler succeeds towards cloudlet allocation resulted to shorter makespan and higher system throughput. The novel scheduling technique was evaluated against certain algorithms using the CloudSim software. When compared to existing algorithms such as Particle Swarm Optimization (PSO) and Ant Colony Optimization (ACO), the experimental findings show that the suggested approach outperforms them.
使用元启发式方法优化云中的调度
云计算的目标是通过聚合资源来优化资源的使用,从而提高吞吐量,以最有效的方式解决计算难题。在云环境下,任务调度问题由于其NP-hard性质,不符合精确解。为了解决这个问题,已经开发了各种元启发式策略。任务调度器应该为用户的作业定位最佳资源,同时考虑到特定的云任务参数约束。本文描述了一种混合任务调度策略,该策略结合了深度学习和自然启发的元启发式优化,以最大限度地提高云吞吐量,同时最大限度地减少IaaS云中的完成时间。调度器成功地实现了cloudlet分配,从而缩短了完工时间和提高了系统吞吐量。使用CloudSim软件对这种新的调度技术与某些算法进行了评估。与现有的粒子群算法(PSO)和蚁群算法(ACO)进行比较,实验结果表明,本文提出的方法具有更好的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
3.10
自引率
21.40%
发文量
126
×
引用
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学术官方微信