4.7 Article

Delay-Optimal Distributed Edge Computation Offloading With Correlated Computation and Communication Workloads

Journal

IEEE TRANSACTIONS ON MOBILE COMPUTING
Volume 22, Issue 10, Pages 5846-5857

Publisher

IEEE COMPUTER SOC
DOI: 10.1109/TMC.2022.3190046

Keywords

Processor scheduling; Wireless communication; Performance evaluation; Image edge detection; Resource management; Task analysis; Scheduling; Edge computation offloading; distributed and parallel computing; communication scheduling

Ask authors/readers for more resources

This article explores the correlation between computation workloads and communication workloads in distributed edge computation offloading, aiming to minimize the total completion time. The authors tackle challenges such as precedence constraints, interference constraints, and workload correlation in order to devise efficient policies that approach the optimal solution. Their results provide valuable insights for the computation-communication co-design of distributed edge computation offloading.
Distributed edge computation offloading makes use of distributed wireless edge devices to perform offloaded computation in parallel, which can substantially reduce the computation time. In this article, we explore distributed edge computation offloading where the computation workloads of edge devices are correlated with their communication workloads. In particular, we study the fundamental problem of computation workload allocation and communication scheduling for minimizing the total completion time of the computation offloading. To solve this problem, we need to tackle several challenges due to the precedence constraints of computations and communications, the interference constraints of wireless edge devices, and the correlation between computation and communication workloads. We consider preemptive, half-preemptive, and non-preemptive networks for the formulated problem, respectively. For each setting, we first develop a simplified problem of computation allocation, based on which we then devise an efficient and feasible policy that can arbitrarily approach the optimal policy. For half-preemptive and non-preemptive networks, we also characterize the optimal communication orders. Our results provides useful insights for the computation-communication co-design of distributed edge computation offloading. We evaluate the proposed algorithms using simulation results, which corroborate the advantages of the algorithms.

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