基于增强邻域搜索的粒子群优化云计算任务调度

Saleh Al Shamaa, Nabil Harrabida, Wei Shi, M. St-Hilaire
{"title":"基于增强邻域搜索的粒子群优化云计算任务调度","authors":"Saleh Al Shamaa, Nabil Harrabida, Wei Shi, M. St-Hilaire","doi":"10.1109/CloudSummit54781.2022.00011","DOIUrl":null,"url":null,"abstract":"Due to cloud computing services' dynamic and elastic nature, implementing efficient task scheduling methods becomes primordial for cloud providers to handle the ever-growing demands and meet the Service Level Agreements (SLA) cost-effectively. In this paper, we propose a novel task scheduling approach, named ENS-PSO, that enhances Particle Swarm Op-timization (PSO) with an efficient neighborhood search strategy. We evaluate ENS-PSO using the CloudSim toolkit. Simulation results demonstrate that the proposed task scheduling with en-hanced neighborhood search outperforms other task scheduling algorithms in terms of makespan, energy consumption, and degree of imbalance.","PeriodicalId":106553,"journal":{"name":"2022 IEEE Cloud Summit","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2022-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Particle Swarm Optimization with Enhanced Neighborhood Search for Task Scheduling in Cloud Computing\",\"authors\":\"Saleh Al Shamaa, Nabil Harrabida, Wei Shi, M. St-Hilaire\",\"doi\":\"10.1109/CloudSummit54781.2022.00011\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Due to cloud computing services' dynamic and elastic nature, implementing efficient task scheduling methods becomes primordial for cloud providers to handle the ever-growing demands and meet the Service Level Agreements (SLA) cost-effectively. In this paper, we propose a novel task scheduling approach, named ENS-PSO, that enhances Particle Swarm Op-timization (PSO) with an efficient neighborhood search strategy. We evaluate ENS-PSO using the CloudSim toolkit. Simulation results demonstrate that the proposed task scheduling with en-hanced neighborhood search outperforms other task scheduling algorithms in terms of makespan, energy consumption, and degree of imbalance.\",\"PeriodicalId\":106553,\"journal\":{\"name\":\"2022 IEEE Cloud Summit\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 IEEE Cloud Summit\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CloudSummit54781.2022.00011\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE Cloud Summit","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CloudSummit54781.2022.00011","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

由于云计算服务的动态性和弹性,实现高效的任务调度方法成为云提供商处理不断增长的需求并经济有效地满足服务水平协议(SLA)的首要任务。本文提出了一种新的任务调度方法ENS-PSO,该方法通过有效的邻域搜索策略增强了粒子群优化算法。我们使用CloudSim工具包评估ENS-PSO。仿真结果表明,基于增强邻域搜索的任务调度算法在最大跨度、能耗和不平衡程度等方面都优于其他任务调度算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Particle Swarm Optimization with Enhanced Neighborhood Search for Task Scheduling in Cloud Computing
Due to cloud computing services' dynamic and elastic nature, implementing efficient task scheduling methods becomes primordial for cloud providers to handle the ever-growing demands and meet the Service Level Agreements (SLA) cost-effectively. In this paper, we propose a novel task scheduling approach, named ENS-PSO, that enhances Particle Swarm Op-timization (PSO) with an efficient neighborhood search strategy. We evaluate ENS-PSO using the CloudSim toolkit. Simulation results demonstrate that the proposed task scheduling with en-hanced neighborhood search outperforms other task scheduling algorithms in terms of makespan, energy consumption, and degree of imbalance.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信