Numerically Stable Polynomially Coded Computing

Mohammad Fahim, Viveck R. Cadambe

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

9 Scopus citations

Abstract

We consider the issue of numerical stability in solving the problem of coded large scale matrix multiplication in distributed systems where worker nodes are prone to failures/delays. We construct new codes that achieve comparable fault tolerance as previous codes, but are more numerically stable. Unlike previous codes that use polynomials expanded in a monomial basis, our codes use polynomials expressed in a basis of orthonormal polynomials. We show via new theoretical results on the condition number, as well as numerical experiments, that the application of these codes can lead to significantly more numerically stable computation than the current monomial-basis codes.

Original languageEnglish (US)
Title of host publication2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages3017-3021
Number of pages5
ISBN (Electronic)9781538692912
DOIs
StatePublished - Jul 2019
Event2019 IEEE International Symposium on Information Theory, ISIT 2019 - Paris, France
Duration: Jul 7 2019Jul 12 2019

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
Volume2019-July
ISSN (Print)2157-8095

Conference

Conference2019 IEEE International Symposium on Information Theory, ISIT 2019
CountryFrance
CityParis
Period7/7/197/12/19

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Numerically Stable Polynomially Coded Computing'. Together they form a unique fingerprint.

Cite this