.png){kind=icon}
返回
Local Re-Encoding for Coded Matrix Multiplication
.png){kind=icon}
OA
AI
DOI：10.1109/OJCOMS.2022.3194130.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Matrix multiplication is a fundamental operation in various algorithms for big data analytics and machine learning. As the size of the dataset increases rapidly, it is now a common practice to distribute the computation on multiple servers. As straggling servers are inevitable in a distributed infrastructure, various coding schemes have been proposed to tolerate potential stragglers. However, as resources are shared with other jobs in a distributed infrastructure and their performance can change dynamically, the optimal way of encoding the input matrices is not static. So far, all existing coding schemes require encoding input matrices in advance, and cannot change the coding schemes or adjust their parameters flexibly. In this paper, we propose a framework that can change the coding schemes and/or their parameters by locally re-encoding the coded task on each server. We first present this framework for entangled polynomial codes, which changes the coding parameters with marginal overhead and saves job completion time. We then extend the framework for matrices with bounded entries, achieving a higher level of flexibility for local re-encoding while maintaining better numerical stability.
Keyword:
Encoding
Task analysis
Codes
Servers
Numerical stability
Sparse matrices
Manganese
Big data infrastructure
matrix multiplication
re-encoding
numerical stability
期刊
I
IF:
4.3
论文数:
1.7K
被引数:
991
机构
引用论文
分享收藏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
分享收藏
查看更多内容