IGWOA:改进的灰狼优化算法,用于云雾环境中延迟敏感应用的资源调度

IF 3.3 4区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS
{"title":"IGWOA:改进的灰狼优化算法,用于云雾环境中延迟敏感应用的资源调度","authors":"","doi":"10.1007/s12083-024-01642-w","DOIUrl":null,"url":null,"abstract":"<h3>Abstract</h3> <p>Fog computing, a technology that offers adaptable and scalable computing resources, facing a significant difficulty in task scheduling, affecting system performance and customer satisfaction. Finding solutions to the task scheduling problem is challenging due to its NP-completeness. Researchers suggest a hybrid approach that combines the Grey Wolf Optimization Algorithm (GWO) and Heterogeneous earliest finishing time (HEFT) to address this problem. The hybrid IGWOA (Improved Grey Wolf optimization algorithm) method seeks to minimize makespan and throughput while focusing on multi-objective resource scheduling in Fog computing. Proposed algorithm is suggested to improve the exploration and exploitation phases of the traditional grey wolf algorithm. Furthermore, the HEFT-based GWO algorithm has the benefit of faster convergence in larger scheduling problems. The effectiveness of the suggested algorithm in comparison to existing techniques has been evaluated using the iFogsim toolkit. Real data set and pseudo workloads both are used for working. The statistical method Analysis of Variance (ANOVA) is used to confirm the results. The effectiveness of it in reducing makespan, and throughput is demonstrated by experimental results on 200–1000 tasks. Particularly, the proposed approach outperforms peer competing techniques AEOSSA, HHO, PSO, and FA in relation to makespan and throughput; successfully, improvement is noticed on makespan up to 9.34% over the AEOSSA and up to 72.56% over other optimization techniques for pseudo workload. Additionally, it also showed improvement on makespan up to 6.89% over the AEOSSA and up to 69.73% over other optimization techniques on NASA iPSC and HPC2N real data sets, while improving throughput by 62.4%, 52.8%, and 41.6% on pseudo workload, NASA iPSC, and HPC2N data sets, respectively. These results show proposed approach solves the resource scheduling issue in Fog computing settings.</p>","PeriodicalId":49313,"journal":{"name":"Peer-To-Peer Networking and Applications","volume":"30 1","pages":""},"PeriodicalIF":3.3000,"publicationDate":"2024-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"IGWOA: Improved Grey Wolf optimization algorithm for resource scheduling in cloud-fog environment for delay-sensitive applications\",\"authors\":\"\",\"doi\":\"10.1007/s12083-024-01642-w\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<h3>Abstract</h3> <p>Fog computing, a technology that offers adaptable and scalable computing resources, facing a significant difficulty in task scheduling, affecting system performance and customer satisfaction. Finding solutions to the task scheduling problem is challenging due to its NP-completeness. Researchers suggest a hybrid approach that combines the Grey Wolf Optimization Algorithm (GWO) and Heterogeneous earliest finishing time (HEFT) to address this problem. The hybrid IGWOA (Improved Grey Wolf optimization algorithm) method seeks to minimize makespan and throughput while focusing on multi-objective resource scheduling in Fog computing. Proposed algorithm is suggested to improve the exploration and exploitation phases of the traditional grey wolf algorithm. Furthermore, the HEFT-based GWO algorithm has the benefit of faster convergence in larger scheduling problems. The effectiveness of the suggested algorithm in comparison to existing techniques has been evaluated using the iFogsim toolkit. Real data set and pseudo workloads both are used for working. The statistical method Analysis of Variance (ANOVA) is used to confirm the results. The effectiveness of it in reducing makespan, and throughput is demonstrated by experimental results on 200–1000 tasks. Particularly, the proposed approach outperforms peer competing techniques AEOSSA, HHO, PSO, and FA in relation to makespan and throughput; successfully, improvement is noticed on makespan up to 9.34% over the AEOSSA and up to 72.56% over other optimization techniques for pseudo workload. Additionally, it also showed improvement on makespan up to 6.89% over the AEOSSA and up to 69.73% over other optimization techniques on NASA iPSC and HPC2N real data sets, while improving throughput by 62.4%, 52.8%, and 41.6% on pseudo workload, NASA iPSC, and HPC2N data sets, respectively. These results show proposed approach solves the resource scheduling issue in Fog computing settings.</p>\",\"PeriodicalId\":49313,\"journal\":{\"name\":\"Peer-To-Peer Networking and Applications\",\"volume\":\"30 1\",\"pages\":\"\"},\"PeriodicalIF\":3.3000,\"publicationDate\":\"2024-03-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Peer-To-Peer Networking and Applications\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1007/s12083-024-01642-w\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Peer-To-Peer Networking and Applications","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1007/s12083-024-01642-w","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

摘要 雾计算是一种提供适应性强、可扩展计算资源的技术,但在任务调度方面面临着巨大困难,影响着系统性能和客户满意度。由于任务调度问题具有 NP-完备性,因此寻找任务调度问题的解决方案极具挑战性。研究人员提出了一种结合灰狼优化算法(GWO)和异构最早完成时间(HEFT)的混合方法来解决这一问题。混合 IGWOA(改进的灰狼优化算法)方法旨在最大限度地减少时间跨度和吞吐量,同时关注雾计算中的多目标资源调度。建议采用所提出的算法来改进传统灰狼算法的探索和开发阶段。此外,基于 HEFT 的 GWO 算法还具有在较大调度问题中收敛更快的优点。使用 iFogsim 工具包评估了建议算法与现有技术相比的有效性。工作中使用了真实数据集和伪工作负载。统计方法方差分析(ANOVA)用于确认结果。通过对 200-1000 个任务的实验结果,证明了该方法在减少时间跨度(makespan)和吞吐量(throughput)方面的有效性。特别是,在时间跨度和吞吐量方面,所提出的方法优于同类竞争技术 AEOSSA、HHO、PSO 和 FA;在伪工作量方面,成功地比 AEOSSA 的时间跨度提高了 9.34%,比其他优化技术提高了 72.56%。此外,在 NASA iPSC 和 HPC2N 真实数据集上,与 AEOSSA 相比,成功改善了 Makepan 达 6.89%,与其他优化技术相比,成功改善了 Makepan 达 69.73%,而在伪工作负载、NASA iPSC 和 HPC2N 数据集上,吞吐量分别提高了 62.4%、52.8% 和 41.6%。这些结果表明,所提出的方法解决了雾计算环境中的资源调度问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
IGWOA: Improved Grey Wolf optimization algorithm for resource scheduling in cloud-fog environment for delay-sensitive applications

Abstract

Fog computing, a technology that offers adaptable and scalable computing resources, facing a significant difficulty in task scheduling, affecting system performance and customer satisfaction. Finding solutions to the task scheduling problem is challenging due to its NP-completeness. Researchers suggest a hybrid approach that combines the Grey Wolf Optimization Algorithm (GWO) and Heterogeneous earliest finishing time (HEFT) to address this problem. The hybrid IGWOA (Improved Grey Wolf optimization algorithm) method seeks to minimize makespan and throughput while focusing on multi-objective resource scheduling in Fog computing. Proposed algorithm is suggested to improve the exploration and exploitation phases of the traditional grey wolf algorithm. Furthermore, the HEFT-based GWO algorithm has the benefit of faster convergence in larger scheduling problems. The effectiveness of the suggested algorithm in comparison to existing techniques has been evaluated using the iFogsim toolkit. Real data set and pseudo workloads both are used for working. The statistical method Analysis of Variance (ANOVA) is used to confirm the results. The effectiveness of it in reducing makespan, and throughput is demonstrated by experimental results on 200–1000 tasks. Particularly, the proposed approach outperforms peer competing techniques AEOSSA, HHO, PSO, and FA in relation to makespan and throughput; successfully, improvement is noticed on makespan up to 9.34% over the AEOSSA and up to 72.56% over other optimization techniques for pseudo workload. Additionally, it also showed improvement on makespan up to 6.89% over the AEOSSA and up to 69.73% over other optimization techniques on NASA iPSC and HPC2N real data sets, while improving throughput by 62.4%, 52.8%, and 41.6% on pseudo workload, NASA iPSC, and HPC2N data sets, respectively. These results show proposed approach solves the resource scheduling issue in Fog computing settings.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Peer-To-Peer Networking and Applications
Peer-To-Peer Networking and Applications COMPUTER SCIENCE, INFORMATION SYSTEMS-TELECOMMUNICATIONS
CiteScore
8.00
自引率
7.10%
发文量
145
审稿时长
12 months
期刊介绍: The aim of the Peer-to-Peer Networking and Applications journal is to disseminate state-of-the-art research and development results in this rapidly growing research area, to facilitate the deployment of P2P networking and applications, and to bring together the academic and industry communities, with the goal of fostering interaction to promote further research interests and activities, thus enabling new P2P applications and services. The journal not only addresses research topics related to networking and communications theory, but also considers the standardization, economic, and engineering aspects of P2P technologies, and their impacts on software engineering, computer engineering, networked communication, and security. The journal serves as a forum for tackling the technical problems arising from both file sharing and media streaming applications. It also includes state-of-the-art technologies in the P2P security domain. Peer-to-Peer Networking and Applications publishes regular papers, tutorials and review papers, case studies, and correspondence from the research, development, and standardization communities. Papers addressing system, application, and service issues are encouraged.
×
引用
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学术官方微信