In distributed computing, a number of available helper nodes assist in completing a task for the master node. In such setups, the failure or straggling of even a single helper node can significantly increase the processing time. Therefore, coded distributed computing has been the subject of many recent studies. A problem that arises in some setups is that the master’s decoding complexity may exceed the complexity of self-computation, rending distributed computing useless. One such case is distributed large-scale FFT, where many helper nodes are required. In this work, we propose a novel distributed coded FFT, where the master’s load is significantly lower than the existing work. The gain is obtained by (1) using a novel distributed FFT structure which allows for reliable distributed coding at the Shuffle stage, and (2) using Raptor codes which enjoy a linear complexity at the cost of a small number of extra helper nodes. Numerical results are provided to support the benefits of our proposed solution and to optimize design parameters.

中文翻译：

---

一种用于大规模分布式FFT的分布式低复杂度编码方案

在分布式计算中，许多可用的辅助节点协助主节点完成任务。在这样的设置中，即使是单个帮助节点的故障或拖延也会显着增加处理时间。因此，编码分布式计算已成为许多最近研究的主题。在某些设置中出现的一个问题是，master 的解码复杂度可能会超过自计算的复杂度，从而导致分布式计算无用。一种这样的情况是分布式大规模 FFT，其中需要许多辅助节点。在这项工作中，我们提出了一种新颖的分布式编码 FFT，其中 master 的负载明显低于现有工作。增益通过 (1) 使用一种新颖的分布式 FFT 结构获得，该结构允许在 Shuffle 阶段进行可靠的分布式编码，(2) 使用具有线性复杂度的 Raptor 代码，代价是少量额外的辅助节点。提供的数值结果支持我们提出的解决方案的好处并优化设计参数。