Bivariate Hermitian Polynomial Coding for Efficient Distributed Matrix Multiplication
Bivariate Hermitian Polynomial Coding for Efficient Distributed Matrix Multiplication
复制标题
用于高效分布式矩阵乘法的双变量埃尔米特多项式编码
DOI：
10.1109/globecom42002.2020.9322629
复制
发表时间：
2020
期刊：
影响因子：
--
通讯作者：
Deniz Gündüz
中科院分区：
文献类型：
--
作者：
Burak Hasircioglu;J. Gómez;Deniz Gündüz
编码分布式计算是一种有效的框架，以提高分布式计算系统的速度，减少掉队者（暂时慢工人）。本质上，编码计算允许通过分配冗余计算来替换分配给落后工作者的计算。目前提出的编码计算技术大多基于一元多项式编码。这些代码是不是很有效，如果存储和计算能力的工人是异构的，完全失去了离散的工人所做的工作。对于分布式矩阵矩阵乘法的特定问题，我们展示了二元多项式编码如何解决这两个问题。
Coded distributed computing is an effective framework to improve the speed of distributed computing systems by mitigating stragglers (temporarily slow workers). In essence, coded computing allows replacing the computation assigned to a straggling worker by that at a faster worker by assigning redundant computations. Coded computing techniques proposed so far are mostly based on univariate polynomial coding. These codes are not very effective if storage and computation capacity across workers are heterogeneous and lose completely the work done by the straggling workers. For the particular problem of distributed matrix-matrix multiplication, we show how bivariate polynomial coding addresses these two issues.