A cost, time, energy-aware workflow scheduling using adaptive PSO algorithm in a cloud–fog environment

IF 3.3 3区 计算机科学 Q2 COMPUTER SCIENCE, THEORY & METHODS Computing Pub Date : 2024-07-31 DOI:10.1007/s00607-024-01322-w
Gyan Singh, Amit K. Chaturvedi
{"title":"A cost, time, energy-aware workflow scheduling using adaptive PSO algorithm in a cloud–fog environment","authors":"Gyan Singh, Amit K. Chaturvedi","doi":"10.1007/s00607-024-01322-w","DOIUrl":null,"url":null,"abstract":"<p>Recent years have seen an exponential rise in data produced by Internet of Things (IoT) applications. Cloud servers were not designed for such extensive data, leading to challenges like increased makespan, cost, bandwidth, energy consumption, and network latency. To address these, the cloud–fog environment has emerged as an extension to cloud servers, offering services closer to IoT devices. Scheduling workflow applications to optimize multiple conflicting objectives in cloud fog is an NP-hard problem. Particle Swarm Optimization (PSO) is a good choice for multi-objective solutions due to its simplicity and rapid convergence. However, it has shortcomings like premature convergence and stagnation. To address these challenges, we formalize a theoretical background for scheduling workflow applications in the cloud–fog environment with multiple conflicting objectives. Subsequently, we propose an adaptive particle swarm optimization (APSO) algorithm with novel enhancements, including an S-shaped sigmoid function to dynamically decrease inertia weight and a linear updating mechanism for cognitive factors. Their integration in cloud–fog environments has not been previously explored. This novel application addresses unique challenges of workflow scheduling in cloud–fog systems, such as heterogeneous resource management, energy consumption, and increased cost. The effectiveness of APSO is evaluated using a real-world scientific workflow in a simulated cloud–fog environment and compared with four meta-heuristics. Our proposed workflow scheduling significantly reduces makespan and energy consumption without compromising overall cost compared to other meta-heuristics.</p>","PeriodicalId":10718,"journal":{"name":"Computing","volume":null,"pages":null},"PeriodicalIF":3.3000,"publicationDate":"2024-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computing","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1007/s00607-024-01322-w","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

Abstract

Recent years have seen an exponential rise in data produced by Internet of Things (IoT) applications. Cloud servers were not designed for such extensive data, leading to challenges like increased makespan, cost, bandwidth, energy consumption, and network latency. To address these, the cloud–fog environment has emerged as an extension to cloud servers, offering services closer to IoT devices. Scheduling workflow applications to optimize multiple conflicting objectives in cloud fog is an NP-hard problem. Particle Swarm Optimization (PSO) is a good choice for multi-objective solutions due to its simplicity and rapid convergence. However, it has shortcomings like premature convergence and stagnation. To address these challenges, we formalize a theoretical background for scheduling workflow applications in the cloud–fog environment with multiple conflicting objectives. Subsequently, we propose an adaptive particle swarm optimization (APSO) algorithm with novel enhancements, including an S-shaped sigmoid function to dynamically decrease inertia weight and a linear updating mechanism for cognitive factors. Their integration in cloud–fog environments has not been previously explored. This novel application addresses unique challenges of workflow scheduling in cloud–fog systems, such as heterogeneous resource management, energy consumption, and increased cost. The effectiveness of APSO is evaluated using a real-world scientific workflow in a simulated cloud–fog environment and compared with four meta-heuristics. Our proposed workflow scheduling significantly reduces makespan and energy consumption without compromising overall cost compared to other meta-heuristics.

Abstract Image

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
云雾环境中使用自适应 PSO 算法的成本、时间和能源感知工作流调度系统
近年来,物联网(IoT)应用产生的数据呈指数级增长。云服务器并不是为处理如此大量的数据而设计的,这导致了诸如时间跨度、成本、带宽、能耗和网络延迟增加等挑战。为了解决这些问题,云雾环境作为云服务器的扩展而出现,提供更接近物联网设备的服务。在云雾环境中调度工作流应用程序以优化多个相互冲突的目标是一个 NP 难问题。粒子群优化(PSO)因其简单性和快速收敛性,是多目标解决方案的不错选择。然而,它也存在过早收敛和停滞等缺点。为了应对这些挑战,我们正式提出了在云雾环境中调度具有多个冲突目标的工作流应用的理论背景。随后,我们提出了一种自适应粒子群优化(APSO)算法,并对该算法进行了新的改进,包括使用 S 型 sigmoid 函数动态降低惯性权重和认知因素的线性更新机制。在云雾环境中整合这些算法,此前还从未有过探索。这种新颖的应用解决了云雾系统中工作流调度所面临的独特挑战,如异构资源管理、能源消耗和成本增加等。我们使用模拟云雾环境中的真实科学工作流对 APSO 的有效性进行了评估,并与四种元启发式算法进行了比较。与其他元启发式相比,我们提出的工作流调度方法在不影响总体成本的情况下显著降低了时间跨度和能耗。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Computing
Computing 工程技术-计算机:理论方法
CiteScore
8.20
自引率
2.70%
发文量
107
审稿时长
3 months
期刊介绍: Computing publishes original papers, short communications and surveys on all fields of computing. The contributions should be written in English and may be of theoretical or applied nature, the essential criteria are computational relevance and systematic foundation of results.
期刊最新文献
Mapping and just-in-time traffic congestion mitigation for emergency vehicles in smart cities Fog intelligence for energy efficient management in smart street lamps Contextual authentication of users and devices using machine learning Multi-objective service composition optimization problem in IoT for agriculture 4.0 Robust evaluation of GPU compute instances for HPC and AI in the cloud: a TOPSIS approach with sensitivity, bootstrapping, and non-parametric analysis
×
引用
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