.png){kind=icon}
返回
Delay Optimization of Coded Computing With Hierarchical Task Partitioning
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2023.3320283.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Coded computing
communication delay
hierarchical task partitioning
queueing system
MINLP
期刊
IF:
4.4
论文数:
1.3W
被引数:
2.2W
机构
引用论文
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
OAAI分享收藏
分享收藏分享收藏Secure Distributed Computing With Straggling Servers Using Polynomial Codes使用多项式代码通过分散的服务器进行安全的分布式计算OAAI
OAAI分享收藏
查看更多内容