基于容器迁移机制的新型多目标优化 DAG 任务调度策略

IF 2.1 4区 计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS
Wenjia Deng, Lin Zhu, Yang Shen, Chuan Zhou, Jian Guo, Yong Cheng
{"title":"基于容器迁移机制的新型多目标优化 DAG 任务调度策略","authors":"Wenjia Deng, Lin Zhu, Yang Shen, Chuan Zhou, Jian Guo, Yong Cheng","doi":"10.1007/s11276-024-03811-4","DOIUrl":null,"url":null,"abstract":"<p>In order to solve the complex task scheduling problem of fog computing processing big data in the industrial Internet of Things, a task scheduling strategy based on ant colony algorithm called TSSAC (task scheduling strategy with ant colony)is proposed. Tasks with dependencies are modeled as a directed acyclic graph. The performance indices including makespan, load balancing and energy consumption of fog server are optimized simultaneously, and the ant colony algorithm is used to solve the multi-objective optimization problem. The pheromone heuristic factor and pheromone evaporation coefficient of the ant colony algorithm are updated in a linear increasing way, so that the ants are less affected by pheromones in the early stage and obtain a larger search range. During the later stage, it is greatly affected by pheromone and quickly converges to the optimal solution. Furthermore, during the task execution container migration mechanism is introduced to solve the overload problem caused by high server utilization and energy loss caused by low server utilization simultaneously. The simulation results show that the proposed task scheduling strategy TSSAC reduces energy consumption by 23.5% compared with the traditional algorithm, meanwhile, achieves a compromise between task makespan and load balancing index compared with the traditional algorithm.</p>","PeriodicalId":23750,"journal":{"name":"Wireless Networks","volume":"10 1","pages":""},"PeriodicalIF":2.1000,"publicationDate":"2024-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A novel multi-objective optimized DAG task scheduling strategy for fog computing based on container migration mechanism\",\"authors\":\"Wenjia Deng, Lin Zhu, Yang Shen, Chuan Zhou, Jian Guo, Yong Cheng\",\"doi\":\"10.1007/s11276-024-03811-4\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>In order to solve the complex task scheduling problem of fog computing processing big data in the industrial Internet of Things, a task scheduling strategy based on ant colony algorithm called TSSAC (task scheduling strategy with ant colony)is proposed. Tasks with dependencies are modeled as a directed acyclic graph. The performance indices including makespan, load balancing and energy consumption of fog server are optimized simultaneously, and the ant colony algorithm is used to solve the multi-objective optimization problem. The pheromone heuristic factor and pheromone evaporation coefficient of the ant colony algorithm are updated in a linear increasing way, so that the ants are less affected by pheromones in the early stage and obtain a larger search range. During the later stage, it is greatly affected by pheromone and quickly converges to the optimal solution. Furthermore, during the task execution container migration mechanism is introduced to solve the overload problem caused by high server utilization and energy loss caused by low server utilization simultaneously. The simulation results show that the proposed task scheduling strategy TSSAC reduces energy consumption by 23.5% compared with the traditional algorithm, meanwhile, achieves a compromise between task makespan and load balancing index compared with the traditional algorithm.</p>\",\"PeriodicalId\":23750,\"journal\":{\"name\":\"Wireless Networks\",\"volume\":\"10 1\",\"pages\":\"\"},\"PeriodicalIF\":2.1000,\"publicationDate\":\"2024-07-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Wireless Networks\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1007/s11276-024-03811-4\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Wireless Networks","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1007/s11276-024-03811-4","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

为了解决工业物联网中雾计算处理大数据的复杂任务调度问题,提出了一种基于蚁群算法的任务调度策略,称为 TSSAC(蚁群任务调度策略)。具有依赖关系的任务被建模为有向无环图。同时对性能指标进行优化,包括雾服务器的时间跨度、负载平衡和能耗,并使用蚁群算法解决多目标优化问题。蚁群算法的信息素启发式因子和信息素蒸发系数以线性递增的方式更新,使蚂蚁在前期受信息素的影响较小,获得较大的搜索范围。在后期阶段,蚂蚁受信息素的影响较大,会迅速收敛到最优解。此外,在任务执行过程中还引入了容器迁移机制,以同时解决服务器利用率高导致的过载问题和服务器利用率低导致的能量损失问题。仿真结果表明,所提出的任务调度策略 TSSAC 与传统算法相比,能耗降低了 23.5%,同时,与传统算法相比,在任务跨度和负载平衡指标之间实现了折中。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

A novel multi-objective optimized DAG task scheduling strategy for fog computing based on container migration mechanism

A novel multi-objective optimized DAG task scheduling strategy for fog computing based on container migration mechanism

In order to solve the complex task scheduling problem of fog computing processing big data in the industrial Internet of Things, a task scheduling strategy based on ant colony algorithm called TSSAC (task scheduling strategy with ant colony)is proposed. Tasks with dependencies are modeled as a directed acyclic graph. The performance indices including makespan, load balancing and energy consumption of fog server are optimized simultaneously, and the ant colony algorithm is used to solve the multi-objective optimization problem. The pheromone heuristic factor and pheromone evaporation coefficient of the ant colony algorithm are updated in a linear increasing way, so that the ants are less affected by pheromones in the early stage and obtain a larger search range. During the later stage, it is greatly affected by pheromone and quickly converges to the optimal solution. Furthermore, during the task execution container migration mechanism is introduced to solve the overload problem caused by high server utilization and energy loss caused by low server utilization simultaneously. The simulation results show that the proposed task scheduling strategy TSSAC reduces energy consumption by 23.5% compared with the traditional algorithm, meanwhile, achieves a compromise between task makespan and load balancing index compared with the traditional algorithm.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Wireless Networks
Wireless Networks 工程技术-电信学
CiteScore
7.70
自引率
3.30%
发文量
314
审稿时长
5.5 months
期刊介绍: The wireless communication revolution is bringing fundamental changes to data networking, telecommunication, and is making integrated networks a reality. By freeing the user from the cord, personal communications networks, wireless LAN''s, mobile radio networks and cellular systems, harbor the promise of fully distributed mobile computing and communications, any time, anywhere. Focusing on the networking and user aspects of the field, Wireless Networks provides a global forum for archival value contributions documenting these fast growing areas of interest. The journal publishes refereed articles dealing with research, experience and management issues of wireless networks. Its aim is to allow the reader to benefit from experience, problems and solutions described.
×
引用
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学术官方微信