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

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on information theory Vol. 66; no. 3; pp. 1920 - 1933
Main Authors:	Yu, Qian, Maddah-Ali, Mohammad Ali, Avestimehr, A. Salman
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.03.2020 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!