Coded FFT and Its Communication Overhead

05/24/2018
by   Haewon Jeong, et al.
0

We propose a coded computing strategy and examine communication costs of coded computing algorithms to make distributed Fast Fourier Transform (FFT) resilient to errors during the computation. We apply maximum distance separable (MDS) codes to a widely used "Transpose" algorithm for parallel FFT. In the uncoded distributed FFT algorithm, the most expensive step is a single "all-to-all" communication. We compare this with communication overhead of coding in our coded FFT algorithm. We show that by using a systematic MDS code, the communication overhead of coding is negligible in comparison with the communication costs inherent in an uncoded FFT implementation if the number of parity nodes is at most o( K), where K is the number of systematic nodes.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/17/2017

Coded Fourier Transform

We consider the problem of computing the Fourier transform of high-dimen...
research
05/06/2021

Coded Gradient Aggregation: A Tradeoff Between Communication Costs at Edge Nodes and at Helper Nodes

The increasing amount of data generated at the edge/client nodes and the...
research
01/07/2021

Coding for Distributed Multi-Agent Reinforcement Learning

This paper aims to mitigate straggler effects in synchronous distributed...
research
12/21/2017

Block-Diagonal and LT Codes for Distributed Computing With Straggling Servers

We propose two coded schemes for the distributed computing problem of mu...
research
08/20/2018

Improved Latency-Communication Trade-Off for Map-Shuffle-Reduce Systems with Stragglers

In a distributed computing system operating according to the map-shuffle...
research
01/11/2019

Coded Distributed Computing over Packet Erasure Channels

Coded computation is a framework which provides redundancy in distribute...
research
09/08/2021

Computational Polarization: An Information-theoretic Method for Resilient Computing

We introduce an error resilient distributed computing method based on an...

Please sign up or login with your details

Forgot password? Click here to reset