TY - JOUR
T1 - Joint Program Partitioning and Resource Allocation for Completion Time Minimization in Multi-MEC Systems
AU - Yi, Taizhou
AU - Zhang, Guopeng
AU - Wang, Kezhi
AU - Yang, Kun
N1 - Funding information: Research funded by National Natural Science Foundation of China (Grant nos. 61971421).
PY - 2022/5/1
Y1 - 2022/5/1
N2 - This paper considers a practical mobile edge computing (MEC) system, where edge server does not pre-install the program required to perform user offloaded computing tasks. A partial program offloading (PPO) scheme is proposed, which can divide a user program into two parts, where the first part is executed by the user itself and the second part is transferred to an edge server for remote execution. However, the execution of the latter part requires the results of the previous part (called intermediate result) as the input. We aim to minimize the overall time consumption of a multi-server MEC system to complete all user offloaded tasks. It is modeled as a mixed integer nonlinear programming (MINLP) problem which considers user-and-server association, program partitioning, and communication resource allocation in a joint manner. An effective algorithm is developed to solve the problem by exploiting its structural features. First, the task completion time of a single server is minimized given the computing workload and available resource. Then, the working time of the edge servers are balanced by updating user-and-server association and communication resource allocation. Numerical results show that significant performance improvement can be achieved by the proposed scheme.
AB - This paper considers a practical mobile edge computing (MEC) system, where edge server does not pre-install the program required to perform user offloaded computing tasks. A partial program offloading (PPO) scheme is proposed, which can divide a user program into two parts, where the first part is executed by the user itself and the second part is transferred to an edge server for remote execution. However, the execution of the latter part requires the results of the previous part (called intermediate result) as the input. We aim to minimize the overall time consumption of a multi-server MEC system to complete all user offloaded tasks. It is modeled as a mixed integer nonlinear programming (MINLP) problem which considers user-and-server association, program partitioning, and communication resource allocation in a joint manner. An effective algorithm is developed to solve the problem by exploiting its structural features. First, the task completion time of a single server is minimized given the computing workload and available resource. Then, the working time of the edge servers are balanced by updating user-and-server association and communication resource allocation. Numerical results show that significant performance improvement can be achieved by the proposed scheme.
KW - Mobile edge computing
KW - partial program offloading
KW - program partitioning
KW - resource allocation
UR - http://www.scopus.com/inward/record.url?scp=85125752147&partnerID=8YFLogxK
U2 - 10.1109/TNSE.2022.3155177
DO - 10.1109/TNSE.2022.3155177
M3 - Article
AN - SCOPUS:85125752147
SN - 2327-4697
VL - 9
SP - 1932
EP - 1948
JO - IEEE Transactions on Network Science and Engineering
JF - IEEE Transactions on Network Science and Engineering
IS - 3
ER -