Info: Zenodo’s user support line is staffed on regular business days between Dec 23 and Jan 5. Response times may be slightly longer than normal.

Published September 1, 2021 | Version v1
Journal article Open

Bivariate Polynomial Coding for Efficient Distributed Matrix Multiplication

  • 1. Imperial College
  • 2. Centre Tecnològic de Telecomunicacions de Catalunya (CTTC/CERCA)
  • 3. Imperial College London

Description

Coded distributed computing is an effective framework to improve the speed of distributed computing systems by mitigating stragglers (temporarily slow workers). In essence, coded computing allows replacing the computation assigned to a straggling worker by that at a faster worker by assigning redundant computations. Coded computing techniques proposed so far are mostly based on univariate polynomial coding. These codes are not very effective if storage and computation capacity across workers are heterogeneous and lose completely the work done by the straggling workers. For the particular problem of distributed matrix-matrix multiplication, we show how bivariate polynomial coding addresses these two issues.

Notes

This work was partially funded by the European Research Council (ERC) through Starting Grant BEACON (no. 677854) and by the UK EPSRC (grant no. EP/T023600/1) under the CHIST-ERA program. The work of J.G ́omez-Vilardeb ́o was supported in part by the Catalan Government under Grant SGR2017-1479, and by the Spanish Government under Grant RTI2018-099722-B-100 (ARISTIDES)

Files

Bivariate_Polynomial_Codes__journal_version_.pdf

Files (597.8 kB)

Name Size Download all
md5:ba9cab73ed361cd37e8e2b9eca7a4cfd
597.8 kB Preview Download