Locally Recoverable Coded Matrix Multiplication

2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Pub Date : 2018-10-01 DOI:10.1109/ALLERTON.2018.8636019

Haewon Jeong, Fangwei Ye, P. Grover

引用次数: 19

Abstract

Repair locality is important to recover from failed nodes in distributed computing especially when communicating all the data to a master node is expensive. Here, building on recent work on coded matrix multiplication, we provide locally recoverable coded matrix multiplication strategies. Leveraging constructions of optimal matrix multiplication codes and optimal locally recoverable (LRC) codes, we provide constructions of LRC Polynomial codes (minimal communication) and LRC MatDot codes (minimal storage).

查看原文本刊更多论文

局部可恢复的编码矩阵乘法

在分布式计算中，修复局部性对于从故障节点中恢复非常重要，特别是在将所有数据通信到主节点的成本很高的情况下。在这里，基于最近关于编码矩阵乘法的工作，我们提供了局部可恢复的编码矩阵乘法策略。利用最优矩阵乘法码和最优局部可恢复(LRC)码的结构，我们提供了LRC多项式码(最小通信)和LRC MatDot码(最小存储)的结构。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)

自引率

0.00%

发文量