Joint scheduling algorithm for correlative tasks in multi-access edge computing
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...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2023-04-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2023047/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1841540009609396224 |
|---|---|
| author | Weifeng LU Ning LI Jia XU Lijie XU Jian XU |
| author_facet | Weifeng LU Ning LI Jia XU Lijie XU Jian XU |
| author_sort | Weifeng LU |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-2238f60ce1e9483b91328ff226b7153d |
| institution | Kabale University |
| issn | 1000-436X |
| language | zho |
| publishDate | 2023-04-01 |
| publisher | Editorial Department of Journal on Communications |
| record_format | Article |
| series | Tongxin xuebao |
| spelling | doaj-art-2238f60ce1e9483b91328ff226b7153d2025-01-14T06:28:25ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2023-04-0144879859390218Joint scheduling algorithm for correlative tasks in multi-access edge computingWeifeng LUNing LIJia XULijie XUJian XUMulti-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.http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2023047/multi-access edge computingcorrelative taskenergy consumptiontask schedulingjoint scheduling algo-rithm |
| spellingShingle | Weifeng LU Ning LI Jia XU Lijie XU Jian XU Joint scheduling algorithm for correlative tasks in multi-access edge computing Tongxin xuebao multi-access edge computing correlative task energy consumption task scheduling joint scheduling algo-rithm |
| title | Joint scheduling algorithm for correlative tasks in multi-access edge computing |
| title_full | Joint scheduling algorithm for correlative tasks in multi-access edge computing |
| title_fullStr | Joint scheduling algorithm for correlative tasks in multi-access edge computing |
| title_full_unstemmed | Joint scheduling algorithm for correlative tasks in multi-access edge computing |
| title_short | Joint scheduling algorithm for correlative tasks in multi-access edge computing |
| title_sort | joint scheduling algorithm for correlative tasks in multi access edge computing |
| topic | multi-access edge computing correlative task energy consumption task scheduling joint scheduling algo-rithm |
| url | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2023047/ |
| work_keys_str_mv | AT weifenglu jointschedulingalgorithmforcorrelativetasksinmultiaccessedgecomputing AT ningli jointschedulingalgorithmforcorrelativetasksinmultiaccessedgecomputing AT jiaxu jointschedulingalgorithmforcorrelativetasksinmultiaccessedgecomputing AT lijiexu jointschedulingalgorithmforcorrelativetasksinmultiaccessedgecomputing AT jianxu jointschedulingalgorithmforcorrelativetasksinmultiaccessedgecomputing |