On the Optimal Recovery Threshold of Coded Matrix Multiplication

We provide novel coded computation strategies for distributed matrix-matrix products that outperform the recent "Polynomial code" constructions in recovery threshold, i.e., the required number of successful workers. When a fixed <inline-formula> <tex-math notation="LaTeX"...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on information theory Vol. 66; no. 1; pp. 278 - 301
Main Authors:	Dutta, Sanghamitra, Fahim, Mohammad, Haddadpour, Farzin, Jeong, Haewon, Cadambe, Viveck, Grover, Pulkit
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.01.2020 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Coded computing Codes Coding Computation Computational complexity Computational efficiency Computational modeling distributed computing Encoding Fault tolerance matrix multiplication Multiplication Polynomials Recovery recovery threshold stragglers Systematics Workers
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!