Original paper

Block-Diagonal and LT Codes for Distributed Computing With Straggling Servers

Volume: 67, Issue: 3, Pages: 1739 - 1753
Published: Mar 1, 2019
Abstract
We propose two coded schemes for the distributed computing problem of multiplying a matrix by a set of vectors. The first scheme is based on partitioning the matrix into submatrices and applying maximum distance separable (MDS) codes to each submatrix. For this scheme, we prove that up to a given number of partitions the communication load and the computational delay (not including the encoding and decoding delay) are identical to those of the...
Paper Details
Title
Block-Diagonal and LT Codes for Distributed Computing With Straggling Servers
Published Date
Mar 1, 2019
Volume
67
Issue
3
Pages
1739 - 1753
Citation AnalysisPro
  • Scinapse’s Top 10 Citation Journals & Affiliations graph reveals the quality and authenticity of citations received by a paper.
  • Discover whether citations have been inflated due to self-citations, or if citations include institutional bias.