arrow
Return

Preemptive Mobile Computation Offloading With Hard Deadlines and Concurrent Local Execution

delete2021-06-01
delete4
PRE
AI
A
Arvin Hekmati
T
T.D. Todd
D
Dongmei Zhao *
G
George Karakostas
DOI:10.1109/TGCN.2021.3061106delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
This paper considers Preemptive Mobile Computation Offloading when concurrent local execution (CLE) is used to guarantee task execution time constraints. By allowing simultaneous local and remote execution, CLE ensures that job deadlines are always satisfied in the face of unforeseen wireless channel conditions. In the preemptive offloading case, at the start of each time slot, a decision is made to either continue or temporarily interrupt the offload. This mechanism allows the system to adapt when channel conditions change. The paper considers the case for homogeneous Markovian wireless channels. Using Markovian decision process stopping theory, an online energy-optimal computation offloading algorithm is formulated for preemptive offloading, referred to as Optimal Preemptive Offloading (OPO). Since the computational complexity of OPO can be prohibitive, the paper introduces three computationally efficient techniques motivated by OPO: 1) water-filling; 2) water-filling with scheduling; and 3) generalized water-filling. For each method, two variations are considered. The first (Equ) uses the equilibrium channel state probabilities in offloading decision calculations, and the second (Exp) uses Markovian transition matrix exponentiation. This results in six algorithms with a wide variety of energy performance and computational complexity. Performance of the algorithms is compared that shows the tradeoffs between complexity and mobile energy saving performance.
Keywords:
Task analysis
Wireless communication
Mobile handsets
Processor scheduling
Servers
Scheduling
Time factors
Cloud computing
mobile computation offloading
energy efficiency
mobile task execution performance
hard job deadline constraints
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

I
IEEE Transactions on Green Communications and Networking
IF:
6.7
Papers:
1.3K
Citations:
4.3K

Organization

U
university of southern california
Scholars:
4.6W
Papers: 3.8W
Citations: 51
M
McMaster University
Scholars:
3.6W
Papers: 3.3W
Citations: 4.4W