.png){kind=icon}
Return
Delay Optimization of Coded Computing With Hierarchical Task Partitioning
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2023.3320283.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Coded computing can combat the straggling effect in distributed computing, especially at the wireless network edge. This letter focuses on the delay optimization of coded computing by jointly considering communication and computation imperfections. We adopt the adaptive privacy-preserving coded computing (APCC) strategy and model the task offloading process as an M/G/1 queueing system. The task division and partitioning problem is formulated as a non-convex mixed-integer non-linear programming (MINLP) with the objective of minimizing the task completion delay. Two near-optimal and low-complexity iterative update algorithms are proposed. Simulation results demonstrate substantial reductions in task completion delay over benchmarks.
Keywords:
Coded computing
communication delay
hierarchical task partitioning
queueing system
MINLP
Journal
IF:
4.4
Papers:
1.3W
Citations:
2.2W
Organization
Cited Papers
Regulation and Functions of the lms Homeobox Gene during Development of Embryonic Lateral Transverse Muscles and Direct Flight Muscles in Drosophila.png)
PLoS ONE
OAAI
PLoS ONEIF0
OAAIShareSave
ShareSaveShareSaveShareSave
View more