A Unified Coding Framework for Distributed Computing with Straggling Servers
A Unified Coding Framework for Distributed Computing with Straggling Servers
复制标题
DOI：
10.1109/glocomw.2016.7848828
复制
发表时间：
2016-09
期刊：
影响因子：
--
通讯作者：
Songze Li;M. Maddah-ali;A. Avestimehr
中科院分区：
文献类型：
--
作者：
Songze Li;M. Maddah-ali;A. Avestimehr
我们提出了一个统一的编码框架与离散服务器的分布式计算，通过引入一些线性计算任务的“计算延迟”和“通信负载”之间的权衡。我们表明，[1]-[3]的编码方案重复中间计算以创建编码多播机会以减少通信负载，[4]的编码方案生成冗余中间计算以对抗离散服务器，可以被视为所提出的框架的特殊实例，通过考虑这种权衡的两个极端：从而分别最小化通信负载或计算等待时间。此外，通过所提出的编码框架实现的延迟-负载权衡允许在该权衡的任何点处系统地操作以执行分布式计算任务。我们还证明了一个信息理论的下限延迟负载的权衡，这是一个常数乘法的差距内实现的权衡在两个端点。
We propose a unified coding framework for distributed computing with straggling servers, by introducing a tradeoff between "latency of computation" and "load of communication" for some linear computation tasks. We show that the coded scheme of [1]-[3] that repeats the intermediate computations to create coded multicasting opportunities to reduce communication load, and the coded scheme of [4] that generates redundant intermediate computations to combat against straggling servers can be viewed as special instances of the proposed framework, by considering two extremes of this tradeoff: minimizing either the load of communication or the latency of computation individually. Furthermore, the latency-load tradeoff achieved by the proposed coded framework allows to systematically operate at any point on that tradeoff to perform distributed computing tasks. We also prove an information-theoretic lower bound on the latency- load tradeoff, which is shown to be within a constant multiplicative gap from the achieved tradeoff at the two end points.