Straggler Mitigation in Distributed Matrix Multiplication: Fundamental Limits and Optimal Coding

We consider the problem of massive matrix multiplication, which underlies many data analytic applications, in a large-scale distributed system comprising a group of worker nodes. We target the stragglers' delay performance bottleneck, which is due to the unpredictable latency in waiting for slo...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on information theory Jg. 66; H. 3; S. 1920 - 1933
Hauptverfasser:	Yu, Qian, Maddah-Ali, Mohammad Ali, Avestimehr, A. Salman
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York IEEE 01.03.2020 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:	coded computing Coding Complexity Complexity theory Computer networks Convolution Data analysis Delays Distributed computing Encoding Fault tolerance Matrices (mathematics) matrix multiplication Multiplication Nodes Optimization Polynomials Recovery Redundancy straggler mitigation Task analysis
ISSN:	0018-9448, 1557-9654
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!