E-AVOA-TS:基于增强型非洲秃鹫优化算法的雾-云计算任务调度策略

IF 3.8 3区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE
R. Ghafari, N. Mansouri
{"title":"E-AVOA-TS:基于增强型非洲秃鹫优化算法的雾-云计算任务调度策略","authors":"R. Ghafari,&nbsp;N. Mansouri","doi":"10.1016/j.suscom.2023.100918","DOIUrl":null,"url":null,"abstract":"<div><p><span><span>In fog computing, inefficient scheduling of user tasks causes more delays. Moreover, how to schedule tasks that need to be offloaded to fog nodes or cloud nodes has not been fully addressed. The </span>task scheduling process needs to be optimized and efficient in order to address the issues of resource utilization, response time, and energy consumption. This paper proposes an Enhanced African Vultures Optimization Algorithm-based Task Scheduling Strategy (E-AVOA-TS) for fog-cloud computing. Through the proposed strategy, each village learns from its neighbors rather than from all of its members. The minimization of makespan, cost, and energy consumption in the proposed algorithm are considered as objective function. To prioritize tasks, the </span>Best Worst Method<span> (BWM) is used to handle the sensitivity of task delays. Latency-sensitive tasks are sent to the fog environment, while latency-tolerant tasks are sent to the cloud. E-AVOA is compared to other state-of-the-art optimizers using classic benchmark functions and ten benchmark tests from CEC-C06. Compared to other competitors, E-AVOA-TS outperforms makespan by 24.2%, cost by 16%, energy consumption by 4.7%, and DST% by 6.2% for large scale tasks. According to the simulation results, makespan shows improvements of 33%, 53%, and 48%, and energy consumption is reduced by 32%, 44%, and 5%, compared with PSG-M, IWC, and DCOHHOTS, respectively.</span></p></div>","PeriodicalId":48686,"journal":{"name":"Sustainable Computing-Informatics & Systems","volume":"40 ","pages":"Article 100918"},"PeriodicalIF":3.8000,"publicationDate":"2023-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"E-AVOA-TS: Enhanced African vultures optimization algorithm-based task scheduling strategy for fog–cloud computing\",\"authors\":\"R. Ghafari,&nbsp;N. Mansouri\",\"doi\":\"10.1016/j.suscom.2023.100918\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p><span><span>In fog computing, inefficient scheduling of user tasks causes more delays. Moreover, how to schedule tasks that need to be offloaded to fog nodes or cloud nodes has not been fully addressed. The </span>task scheduling process needs to be optimized and efficient in order to address the issues of resource utilization, response time, and energy consumption. This paper proposes an Enhanced African Vultures Optimization Algorithm-based Task Scheduling Strategy (E-AVOA-TS) for fog-cloud computing. Through the proposed strategy, each village learns from its neighbors rather than from all of its members. The minimization of makespan, cost, and energy consumption in the proposed algorithm are considered as objective function. To prioritize tasks, the </span>Best Worst Method<span> (BWM) is used to handle the sensitivity of task delays. Latency-sensitive tasks are sent to the fog environment, while latency-tolerant tasks are sent to the cloud. E-AVOA is compared to other state-of-the-art optimizers using classic benchmark functions and ten benchmark tests from CEC-C06. Compared to other competitors, E-AVOA-TS outperforms makespan by 24.2%, cost by 16%, energy consumption by 4.7%, and DST% by 6.2% for large scale tasks. According to the simulation results, makespan shows improvements of 33%, 53%, and 48%, and energy consumption is reduced by 32%, 44%, and 5%, compared with PSG-M, IWC, and DCOHHOTS, respectively.</span></p></div>\",\"PeriodicalId\":48686,\"journal\":{\"name\":\"Sustainable Computing-Informatics & Systems\",\"volume\":\"40 \",\"pages\":\"Article 100918\"},\"PeriodicalIF\":3.8000,\"publicationDate\":\"2023-09-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Sustainable Computing-Informatics & Systems\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S2210537923000732\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Sustainable Computing-Informatics & Systems","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2210537923000732","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0

摘要

在雾计算中,用户任务的低效调度会导致更多的延迟。此外,如何调度需要卸载到雾节点或云节点的任务还没有完全解决。任务调度过程需要优化和高效,以解决资源利用率、响应时间和能耗等问题。本文提出了一种用于雾云计算的基于增强非洲秃鹫优化算法的任务调度策略(E-AVOA-TS)。通过拟议的战略,每个村庄都向邻居学习,而不是向所有成员学习。该算法将完工时间、成本和能耗的最小化作为目标函数。为了对任务进行优先级排序,使用最佳-最差方法(BWM)来处理任务延迟的敏感性。延迟敏感任务被发送到雾环境,而延迟容忍任务则被发送到云。E-AVOA与其他最先进的优化器进行了比较,使用了CEC-C06的经典基准函数和十个基准测试。与其他竞争对手相比,E-AVOA-TS在大规模任务中的性能优于makespan 24.2%、成本16%、能耗4.7%和DST%6.2%。根据模拟结果,与PSG-M、IWC和DCOHHOTS相比,制造跨度分别提高了33%、53%和48%,能耗分别降低了32%、44%和5%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
E-AVOA-TS: Enhanced African vultures optimization algorithm-based task scheduling strategy for fog–cloud computing

In fog computing, inefficient scheduling of user tasks causes more delays. Moreover, how to schedule tasks that need to be offloaded to fog nodes or cloud nodes has not been fully addressed. The task scheduling process needs to be optimized and efficient in order to address the issues of resource utilization, response time, and energy consumption. This paper proposes an Enhanced African Vultures Optimization Algorithm-based Task Scheduling Strategy (E-AVOA-TS) for fog-cloud computing. Through the proposed strategy, each village learns from its neighbors rather than from all of its members. The minimization of makespan, cost, and energy consumption in the proposed algorithm are considered as objective function. To prioritize tasks, the Best Worst Method (BWM) is used to handle the sensitivity of task delays. Latency-sensitive tasks are sent to the fog environment, while latency-tolerant tasks are sent to the cloud. E-AVOA is compared to other state-of-the-art optimizers using classic benchmark functions and ten benchmark tests from CEC-C06. Compared to other competitors, E-AVOA-TS outperforms makespan by 24.2%, cost by 16%, energy consumption by 4.7%, and DST% by 6.2% for large scale tasks. According to the simulation results, makespan shows improvements of 33%, 53%, and 48%, and energy consumption is reduced by 32%, 44%, and 5%, compared with PSG-M, IWC, and DCOHHOTS, respectively.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Sustainable Computing-Informatics & Systems
Sustainable Computing-Informatics & Systems COMPUTER SCIENCE, HARDWARE & ARCHITECTUREC-COMPUTER SCIENCE, INFORMATION SYSTEMS
CiteScore
10.70
自引率
4.40%
发文量
142
期刊介绍: Sustainable computing is a rapidly expanding research area spanning the fields of computer science and engineering, electrical engineering as well as other engineering disciplines. The aim of Sustainable Computing: Informatics and Systems (SUSCOM) is to publish the myriad research findings related to energy-aware and thermal-aware management of computing resource. Equally important is a spectrum of related research issues such as applications of computing that can have ecological and societal impacts. SUSCOM publishes original and timely research papers and survey articles in current areas of power, energy, temperature, and environment related research areas of current importance to readers. SUSCOM has an editorial board comprising prominent researchers from around the world and selects competitively evaluated peer-reviewed papers.
×
引用
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学术官方微信