Journal on Communications ›› 2023, Vol. 44 ›› Issue (4): 87-98.doi: 10.11959/j.issn.1000-436x.2023047

• Papers • Previous Articles     Next Articles

Joint scheduling algorithm for correlative tasks in multi-access edge computing

Weifeng LU1,2, Ning LI1,2, Jia XU1,2, Lijie XU1,2, Jian XU3   

  1. 1 School of Computer Science, Nanjing University of Posts and Telecommunications, Nanjing 210023, China
    2 Jiangsu Key Laboratory of Big Data Security and Intelligent Processing, Nanjing University of Posts and Telecommunications, Nanjing 210023, China
    3 School of Computer Science and Engineering, Nanjing University of Science and Technology, Nanjing 210094, China
  • Revised:2023-01-10 Online:2023-04-25 Published:2023-04-01
  • Supported by:
    The National Natural Science Foundation of China(61872193);The National Natural Science Foundation of China(61971235);The National Natural Science Foundation of China(62072254)

Abstract:

Multi-access edge computing (MEC) has emerged as a promising computing paradigm for resource-intensive applications.However, most of the previous research work has not considered correlative tasks, which may lead to infeasible scheduling decisions.Considering that some tasks on the application must be completed locally and another non-negligible energy consumption problem in the multi-access edge computing offloading scenario, the joint scheduling algorithm of correlative tasks on the local and edge sides was studied.The problem was formalized as minimizing the energy consumption in the system while satisfying the application’s completion deadline constraints, and the joint scheduling (JS) algorithm was proposed to solve the problem.Finally, the performance of the JS algorithm in the application completion rate and system energy consumption were analyzed through simulation experiments.The simulation results show that the JS algorithm is superior to other comparison algorithms in the application completion rate and can save at least 43% of the system energy consumption.

Key words: multi-access edge computing, correlative task, energy consumption, task scheduling, joint scheduling algo-rithm

CLC Number: 

No Suggested Reading articles found!