4.6 Article

Mobility-Aware and Code-Oriented Partitioning Computation Offloading in Multi-Access Edge Computing

期刊

JOURNAL OF GRID COMPUTING
卷 20, 期 2, 页码 -

出版社

SPRINGER
DOI: 10.1007/s10723-022-09599-x

关键词

Computation offloading; Multi-access edge computing; Mobility management; Resource allocation; Task dependency

资金

  1. Programs of National Natural Science Foundation of China [62072165, U19A2058]
  2. Open Research Projects of Zhejiang Lab [2020KE0AB01]
  3. Fundamental Research Funds for the Central Universities

向作者/读者索取更多资源

Multi-Access edge computing (MEC) enables less resourceful smart mobile devices (SMDs) to use computation and memory intensive applications by offloading them to edge servers. However, mobility in MEC can significantly influence offloading strategy and overhead, making it difficult to handle precedence among subtasks. To address this, we propose a cost-saving offloading policy with mobility prediction using convex optimization and Lagrangian approach. Our scheme helps moving SMDs in MEC efficiently complete their tasks and analyzes the impact of task dependency on completion time. Experimental results demonstrate significant performance improvement compared to other methods.
Multi-Access edge computing (MEC) enables less resourceful smart mobile devices (SMDs) to use computation and memory intensive applications by offloading them to edge servers with tolerant latency, significantly improving the computing paradigm of SMDs. But, when involving mobility in MEC, offloading strategy and overhead can be significantly influenced by the movements of SMDs. What(')s more, the movements of SMDs make it harder to deal with precedence among subtasks. However, to the best of our knowledge, few articles have studied mobility management in code-oriented partitioning offloading. To give an efficient solution, we propose the cost-saving offloading policy with mobility prediction using convex optimization and Lagrangian approach. Our scheme can help moving SMDs in MEC like driverless vehicles efficiently complete their tasks and reveal the impact of task dependency on completion time. The experimental results show that our algorithm can achieve at least 12% performance improvement on average than other three common methods.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.6
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据