On the optimal recovery threshold of coded matrix multiplication

Mohammad Fahim, Haewon Jeong, Farzin Haddadpour, Sanghamitra Dutta, Viveck Cadambe, Pulkit Grover

Research output: Chapter in Book/Report/Conference proceedingConference contribution

32 Scopus citations

Abstract

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 m-Th fraction of each matrix can be stored in each worker node, polynomial codes require m2 successful workers, while our novel MatDot codes only require 2m-1 successful workers, albeit at a higher communication cost from each worker to the fusion node. Further, we propose 'PolyDot' coding that interpolates between Polynomial codes and MatDot codes. Finally, we demonstrate an application of PolyDot codes to multiplying multiple (> 2) matrices.

Original languageEnglish (US)
Title of host publication55th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2017
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1264-1270
Number of pages7
ISBN (Electronic)9781538632666
DOIs
StatePublished - Jan 17 2018
Event55th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2017 - Monticello, United States
Duration: Oct 3 2017Oct 6 2017

Publication series

Name55th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2017
Volume2018-January

Other

Other55th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2017
CountryUnited States
CityMonticello
Period10/3/1710/6/17

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Hardware and Architecture
  • Signal Processing
  • Energy Engineering and Power Technology
  • Control and Optimization

Fingerprint Dive into the research topics of 'On the optimal recovery threshold of coded matrix multiplication'. Together they form a unique fingerprint.

Cite this