.png){kind=icon}
Return
Optimal Task-Offloading Control for Edge Computing System With Tasks Offloaded and Computed in Sequence
.png){kind=icon}
PRE
AI
DOI：10.1109/TASE.2022.3176745.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper considers the edge computing system (ECS) in which the tasks with dependencies are offloaded and computed in sequence. Different task-offloading orderings come with different ECS memory-cache execution latency (EMCEL) which is caused by writing and reading (WR) the computed results of earlier offloaded tasks between the ECS memory and cache. Therefore, the optimal ordering to offload all the tasks while leading to the minimum EMCEL arises as an interesting issue in practice. This requires to solve a hard exponential explosion optimization problem. To address this issue, this paper first formulates the tasks and their dependencies as a direct acyclic graph (DAG), then converts the exponential explosion problem into a discrete problem that can be solved in polynomial time, and finally develops some theoretical conditions to guide to determine the optimal task-offloading orderings. A novel algorithm called OTOOA to find the optimal task-offloading orderings in polynomial time is proposed. Field experiments show that OTOOA outperforms the existing algorithms. To our best knowledge, this is the initial work towards this issue.
Keywords:
Task analysis
Edge computing
Computer architecture
Servers
Collaboration
Explosions
Writing
Edge computing system (ECS)
task-offloading ordering
direct acyclic graph (DAG)
execution latency
Journal
IF:
6.4
Papers:
5.2K
Citations:
1.6W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSave
View more