Wenjia Deng, Lin Zhu, Yang Shen, Chuan Zhou, Jian Guo, Yong Cheng
{"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}
引用次数: 0
Abstract
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.
期刊介绍:
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.