A Distributed Low-Complexity Coding Solution for Large-Scale Distributed FFT

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 rec...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on communications Vol. 68; no. 11; pp. 6617 - 6628
Main Authors:	Yazdanialahabadi, Arash, Ardakani, Masoud
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.11.2020 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Coding Complexity Complexity theory Computer networks Decoding Design optimization Design parameters Discrete Fourier transforms distributed coding Distributed computing Distributed processing Encoding fast Fourier transform Nodes Raptor code Reliability Task analysis
ISSN:	0090-6778, 1558-0857
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!