Optimizing multi-objective task scheduling in fog computing with GA-PSO algorithm for big data application.

IF 2.4 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS Frontiers in Big Data Pub Date : 2024-02-21 eCollection Date: 2024-01-01 DOI:10.3389/fdata.2024.1358486
Muhammad Saad, Rabia Noor Enam, Rehan Qureshi
{"title":"Optimizing multi-objective task scheduling in fog computing with GA-PSO algorithm for big data application.","authors":"Muhammad Saad, Rabia Noor Enam, Rehan Qureshi","doi":"10.3389/fdata.2024.1358486","DOIUrl":null,"url":null,"abstract":"<p><p>As the volume and velocity of Big Data continue to grow, traditional cloud computing approaches struggle to meet the demands of real-time processing and low latency. Fog computing, with its distributed network of edge devices, emerges as a compelling solution. However, efficient task scheduling in fog computing remains a challenge due to its inherently multi-objective nature, balancing factors like execution time, response time, and resource utilization. This paper proposes a hybrid Genetic Algorithm (GA)-Particle Swarm Optimization (PSO) algorithm to optimize multi-objective task scheduling in fog computing environments. The hybrid approach combines the strengths of GA and PSO, achieving effective exploration and exploitation of the search space, leading to improved performance compared to traditional single-algorithm approaches. The proposed hybrid algorithm results improved the execution time by 85.68% when compared with GA algorithm, by 84% when compared with Hybrid PWOA and by 51.03% when compared with PSO algorithm as well as it improved the response time by 67.28% when compared with GA algorithm, by 54.24% when compared with Hybrid PWOA and by 75.40% when compared with PSO algorithm as well as it improved the completion time by 68.69% when compared with GA algorithm, by 98.91% when compared with Hybrid PWOA and by 75.90% when compared with PSO algorithm when various tasks inputs are given. The proposed hybrid algorithm results also improved the execution time by 84.87% when compared with GA algorithm, by 88.64% when compared with Hybrid PWOA and by 85.07% when compared with PSO algorithm it improved the response time by 65.92% when compared with GA algorithm, by 80.51% when compared with Hybrid PWOA and by 85.26% when compared with PSO algorithm as well as it improved the completion time by 67.60% when compared with GA algorithm, by 81.34% when compared with Hybrid PWOA and by 85.23% when compared with PSO algorithm when various fog nodes are given.</p>","PeriodicalId":52859,"journal":{"name":"Frontiers in Big Data","volume":"7 ","pages":"1358486"},"PeriodicalIF":2.4000,"publicationDate":"2024-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10915077/pdf/","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Frontiers in Big Data","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3389/fdata.2024.1358486","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2024/1/1 0:00:00","PubModel":"eCollection","JCR":"Q3","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

As the volume and velocity of Big Data continue to grow, traditional cloud computing approaches struggle to meet the demands of real-time processing and low latency. Fog computing, with its distributed network of edge devices, emerges as a compelling solution. However, efficient task scheduling in fog computing remains a challenge due to its inherently multi-objective nature, balancing factors like execution time, response time, and resource utilization. This paper proposes a hybrid Genetic Algorithm (GA)-Particle Swarm Optimization (PSO) algorithm to optimize multi-objective task scheduling in fog computing environments. The hybrid approach combines the strengths of GA and PSO, achieving effective exploration and exploitation of the search space, leading to improved performance compared to traditional single-algorithm approaches. The proposed hybrid algorithm results improved the execution time by 85.68% when compared with GA algorithm, by 84% when compared with Hybrid PWOA and by 51.03% when compared with PSO algorithm as well as it improved the response time by 67.28% when compared with GA algorithm, by 54.24% when compared with Hybrid PWOA and by 75.40% when compared with PSO algorithm as well as it improved the completion time by 68.69% when compared with GA algorithm, by 98.91% when compared with Hybrid PWOA and by 75.90% when compared with PSO algorithm when various tasks inputs are given. The proposed hybrid algorithm results also improved the execution time by 84.87% when compared with GA algorithm, by 88.64% when compared with Hybrid PWOA and by 85.07% when compared with PSO algorithm it improved the response time by 65.92% when compared with GA algorithm, by 80.51% when compared with Hybrid PWOA and by 85.26% when compared with PSO algorithm as well as it improved the completion time by 67.60% when compared with GA algorithm, by 81.34% when compared with Hybrid PWOA and by 85.23% when compared with PSO algorithm when various fog nodes are given.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
利用 GA-PSO 算法优化大数据应用中的雾计算多目标任务调度。
随着大数据的数量和速度不断增长,传统的云计算方法难以满足实时处理和低延迟的要求。拥有边缘设备分布式网络的雾计算成为一种引人注目的解决方案。然而,由于雾计算本身具有多目标性,需要平衡执行时间、响应时间和资源利用率等因素,因此雾计算中的高效任务调度仍然是一项挑战。本文提出了一种遗传算法(GA)- 粒子群优化(PSO)混合算法,用于优化雾计算环境中的多目标任务调度。该混合方法结合了遗传算法和 PSO 的优势,实现了对搜索空间的有效探索和利用,与传统的单一算法方法相比,性能有所提高。与 GA 算法相比,混合算法的执行时间缩短了 85.68%;与混合 PWOA 算法相比,执行时间缩短了 84%;与 PSO 算法相比,执行时间缩短了 51.03%;与 GA 算法相比,响应时间缩短了 67.28%;与混合 PWOA 算法相比,响应时间缩短了 54.24%。与 GA 算法相比,它的响应时间缩短了 67.28%;与混合 PWOA 算法相比,它的响应时间缩短了 54.24%;与 PSO 算法相比,它的响应时间缩短了 75.40%;当给定各种任务输入时,与 GA 算法相比,它的完成时间缩短了 68.69%;与混合 PWOA 算法相比,它的完成时间缩短了 98.91%;与 PSO 算法相比,它的完成时间缩短了 75.90%。与 GA 算法相比,混合算法的执行时间缩短了 84.87%;与混合 PWOA 算法相比,执行时间缩短了 88.64%;与 PSO 算法相比,执行时间缩短了 85.07%;与 GA 算法相比,混合算法的响应时间缩短了 65.92%;与混合 PWOA 算法相比,响应时间缩短了 80.51%。与 GA 算法相比,它的响应时间缩短了 65.92%;与混合 PWOA 算法相比,它的响应时间缩短了 80.51%;与 PSO 算法相比,它的响应时间缩短了 85.26%;在给定各种雾节点的情况下,与 GA 算法相比,它的完成时间缩短了 67.60%;与混合 PWOA 算法相比,它的完成时间缩短了 81.34%;与 PSO 算法相比,它的完成时间缩短了 85.23%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
5.20
自引率
3.20%
发文量
122
审稿时长
13 weeks
期刊最新文献
Cultural big data: nineteenth to twenty-first century panoramic visualization. Cybermycelium: a reference architecture for domain-driven distributed big data systems. Cognitive warfare: a conceptual analysis of the NATO ACT cognitive warfare exploratory concept. An enhanced whale optimization algorithm for task scheduling in edge computing environments. Promoting fairness in link prediction with graph enhancement.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1