Block-diagonal coding for distributed computing with straggling servers

We consider the distributed computing problem of multiplying a set of vectors with a matrix. For this scenario, Li et al. recently presented a unified coding framework and showed a fundamental tradeoff between computational delay and communication load. This coding framework is based on maximum dist...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:ITW : 2017 IEEE Information Theory Workshop : 6-10 November 2017 Ročník 2018-January; s. 464 - 468
Hlavní autoři: Severinson, Albin, Graell i Amat, Alexandre, Rosnes, Eirik
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.11.2017
Témata:
Decoding
Delays
Encoding
Runtime
Servers
Task analysis
ISSN:2157-8095
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:We consider the distributed computing problem of multiplying a set of vectors with a matrix. For this scenario, Li et al. recently presented a unified coding framework and showed a fundamental tradeoff between computational delay and communication load. This coding framework is based on maximum distance separable (MDS) codes of code length proportional to the number of rows of the matrix, which can be very large. We propose a block-diagonal coding scheme consisting of partitioning the matrix into submatrices and encoding each submatrix using a shorter MDS code. We show that the assignment of coded matrix rows to servers to minimize the communication load can be formulated as an integer program with a nonlinear cost function, and propose an algorithm to solve it. We further prove that, up to a level of partitioning, the proposed scheme does not incur any loss in terms of computational delay (as defined by Li et al.) and communication load compared to the scheme by Li et al. We also show numerically that, when the decoding time is also taken into account, the proposed scheme significantly lowers the overall computational delay with respect to the scheme by Li et al. For heavy partitioning, this is achieved at the expense of a slight increase in communication load.
ISSN:2157-8095
DOI:10.1109/ITW.2017.8277957