.png){kind=icon}
.png){kind=icon}
Return
Squeezed Polynomial Codes: Communication-Efficient Coded Computation in Straggler-Exploiting Distributed Matrix Multiplication
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2020.3031590.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In a distributed computing environment, there may exist slow processing workers, which are known as stragglers and they can slow down the whole computing process. In this article, we consider coded computation for matrix multiplication tasks in distributed computing, which can mitigate the effect of stragglers by a coding approach. We propose a new communication-efficient coded computation scheme, namely squeezed polynomial codes, for a straggler-exploiting scenario where multiple sub-tasks are assigned to the workers to partially leverage the computation capability of stragglers. The key idea of squeezed polynomial codes is to overlap the encoded matrices in assigning multiple sub-tasks with appropriate polynomial functions in order to reduce the task-allocation communication load from a master to its workers. We compare squeezed polynomial codes with the existing schemes for distributed matrix multiplication in a communication load perspective. Consequently, we show that squeezed polynomial codes can efficiently reduce the communication load while ensuring the optimal recovery condition at a master to obtain final product.
Keywords:
Distributed computing
coded computation
matrix multiplication
polynomial codes
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.6
Papers:
9.8W
Citations:
29.4W