.png){kind=icon}
返回
Securely Straggler-Exploiting Coded Computation for Distributed Matrix Multiplication
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2021.3135581.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we consider coded computation for matrix multiplication tasks in distributed computing, which can mitigate the effect of slow workers, called stragglers, using a coding approach. We assume that the straggler computation results can be leveraged at the master by assigning multiple sub-tasks to the workers. In this scenario, a new coded computation scheme is proposed to preserve the data security and privacy from workers, which is called securely straggler-exploiting codes (SSEC). Moreover, the proposed SSEC can efficiently reduce the communication load in distributed computing for assigning the sub-tasks to the workers, by overlapping the encoded matrices in assigning multiple sub-tasks with appropriate polynomial functions. It is also proven that the data security and privacy constraints are satisfied in SSEC in an information-theoretic sense. In conclusion, SSEC shows good performance on the recovery threshold and communication loads and compare them with the existing secure coded computation schemes for matrix multiplication tasks.
Keyword:
Task analysis
Encoding
Distributed computing
Data privacy
Codes
Data security
Libraries
Distributed computing
coded computation
matrix multiplication
polynomial codes
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
Early Switch to Nilotinib Does Not Overcome the Adverse Outcome for CML Patients Failing to Achieve Early Molecular Response On Imatinib, Despite Excellent Overall Outcomes in the TIDEL II Trial.png)
Blood
BloodIF0
PREAI
分享收藏分享收藏Secure Distributed Computing With Straggling Servers Using Polynomial Codes使用多项式代码通过分散的服务器进行安全的分布式计算
OAAI
OAAI分享收藏
查看更多内容