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

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on communications Jg. 68; H. 11; S. 6617 - 6628
Hauptverfasser:	Yazdanialahabadi, Arash, Ardakani, Masoud
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York IEEE 01.11.2020 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!