通信学报 ›› 2023, Vol. 44 ›› Issue (4): 87-98.doi: 10.11959/j.issn.1000-436x.2023047

• 学术论文 • 上一篇    下一篇

多接入边缘计算中相关性任务的联合调度算法

鲁蔚锋1,2, 李宁1,2, 徐佳1,2, 徐力杰1,2, 徐建3   

  1. 1 南京邮电大学计算机学院、软件学院、网络空间安全学院,江苏 南京 210023
    2 南京邮电大学江苏省大数据安全与智能处理重点实验室,江苏 南京 210023
    3 南京理工大学计算机科学与工程学院,江苏 南京 210094
  • 修回日期:2023-01-10 出版日期:2023-04-25 发布日期:2023-04-01
  • 作者简介:鲁蔚锋(1979- ),男,安徽马鞍山人,博士,南京邮电大学副教授、硕士生导师,主要研究方向为边缘计算、网络安全、区块链等
    李宁(1994- ),男,江苏徐州人,南京邮电大学硕士生,主要研究方向为边缘计算等
    徐佳(1980- ),男,江苏常州人,博士,南京邮电大学教授、博士生导师,主要研究方向为群智感知、边缘计算、无线充电、区块链等
    徐力杰(1983- ),男,江苏盐城人,博士,南京邮电大学副教授、硕士生导师,主要研究方向为传感网/物联网、无线充电网络、边缘计算、移动与分布式计算等
    徐建(1979- ),男,江苏江阴人,博士,南京理工大学教授、博士生导师,主要研究方向为智能运维、网络安全等
  • 基金资助:
    国家自然科学基金资助项目(61872193);国家自然科学基金资助项目(61971235);国家自然科学基金资助项目(62072254)

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)

摘要:

多接入边缘计算已经成为资源密集型应用程序的有前途的计算范式。不过,先前大部分研究工作没有考虑到任务的相关性,这可能导致不可行的调度决策。考虑应用程序上有些任务必须要在本地完成,研究了相关性任务在本地和边缘侧的联合调度方法,并考虑了多接入边缘计算卸载场景下的另一个不可忽视的能耗问题。将问题形式化为在满足应用程序的完成截止时间约束的条件下最小化系统中的能耗,并提出联合调度(JS)算法解决该问题。最后通过仿真实验分析JS算法在应用程序的完成率和系统能耗两方面的性能。仿真结果表明,JS算法在应用程序的完成率上优于其他对比算法并且至少可以节省43%的系统能耗。

关键词: 多接入边缘计算, 相关性任务, 能耗, 任务调度, 联合调度算法

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

中图分类号: 

No Suggested Reading articles found!