4.7 Article

Efficient Dependent Task Offloading for Multiple Applications in MEC-Cloud System

Journal

IEEE TRANSACTIONS ON MOBILE COMPUTING
Volume 22, Issue 4, Pages 2147-2162

Publisher

IEEE COMPUTER SOC
DOI: 10.1109/TMC.2021.3119200

Keywords

Mobile edge computing; task offloading; dependent tasks; multiple mobile applications

Ask authors/readers for more resources

In this paper, a dependent task offloading framework (COFE) is proposed, which allows mobile devices to offload compute-intensive tasks with dependent constraints to the MEC-Cloud system to improve user experience. The task offloading problem is formulated as an average makespan minimization problem, and a heuristic ranking-based algorithm is proposed to assign the offloaded tasks. Theoretical analysis proves the stability of the system under the proposed algorithm, and extensive simulations validate its effectiveness in reducing average makespan and deadline violation probabilities.
With the proliferation of versatile mobile applications, offloading compute-intensive tasks to the MEC/Cloud becomes a dramatic technique due to the limited resources and high user experience requirements at mobile devices. However, most existing works design their task offloading schemes without considering the dependence of tasks and the orchestration of the MEC and Cloud, and thus may limit the system performance. In this paper, we propose a dependent task offloading framework for multiple mobile applications, named COFE, where mobile devices can offload their compute-intensive tasks with dependent constraints to the MEC-Cloud system. It can assign the offloaded tasks to the MEC and Cloud adaptively to improve the user experience. Based on COFE, we formulate the task offloading problem as an average makespan minimization problem, which is proved to be NP-hard. Then, we propose a heuristic ranking-based algorithm to assign the offloaded tasks according to their bottom levels. Theoretical analysis proves the stability of the system under the proposed algorithm and extensive simulations validate that the proposed algorithm can significantly reduce the average makespan and deadline violation probabilities of offloaded applications.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available