arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2107.10448cs.DC
收藏

灵活的分布式矩阵乘法

Flexible Distributed Matrix Multiplication

Weiqi Li, Zhen Chen, Zhiying Wang, Syed A. Jafar, Hamid Jafarkhani

摘要:

考虑离散数未知的分布式矩阵乘法问题,目标是通过将计算分布在N台服务器上,高效灵活地获得两个大型矩阵的乘积.有多达N-R的掉队者,但确切的数量是不知道的先验。为了减少服务器的计算负载,提出了一种灵活的解决方案,以充分利用可用服务器的计算能力。每个服务器的计算任务被分成几个子任务,由Yu等人基于Entangled Polynomial码构造。最终结果可以从更多的服务器中获得,每个服务器完成的计算量较小,或者从更少的服务器中获得,每个服务器完成的计算量较大。所提出的解决方案所需的有限域大小小于2N。此外,最佳的设计参数,如输入矩阵的划分进行了讨论。我们的结构也可以推广到其他设置,如批分布式矩阵乘法和安全的分布式矩阵乘法。

英文摘要:

The distributed matrix multiplication problem with an unknown number of stragglers is considered, where the goal is to efficiently and flexibly obtain the product of two massive matrices by distributing the computation across N servers. There are up to N - R stragglers but the exact number is not known a priori. Motivated by reducing the computation load of each server, a flexible solution is proposed to fully utilize the computation capability of available servers. The computing task for each server is separated into several subtasks, constructed based on Entangled Polynomial codes by Yu et al. The final results can be obtained from either a larger number of servers with a smaller amount of computation completed per server or a smaller number of servers with a larger amount of computation completed per server. The required finite field size of the proposed solution is less than 2N. Moreover, the optimal design parameters such as the partitioning of the input matrices is discussed. Our constructions can also be generalized to other settings such as batch distributed matrix multiplication and secure distributed matrix multiplication.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑