Vis enkel innførsel

dc.contributor.authorSeverinson, Albin
dc.contributor.authorGraell i Amat, Alexandre
dc.contributor.authorRosnes, Eirik
dc.date.accessioned2020-05-18T12:38:06Z
dc.date.available2020-05-18T12:38:06Z
dc.date.issued2019-03
dc.PublishedSeverinson AS, Graell i Amat A, Rosnes E. Block-Diagonal and LT Codes for Distributed Computing with Straggling Servers. IEEE Transactions on Communications. 2019;67(3):1739-1753eng
dc.identifier.issn0090-6778en_US
dc.identifier.issn1558-0857en_US
dc.identifier.urihttps://hdl.handle.net/1956/22296
dc.description.abstractWe 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 scheme recently proposed by Li et al., based on a single, long MDS code. However, due to the use of shorter MDS codes, our scheme yields a significantly lower overall computational delay when the delay incurred by encoding and decoding is also considered. We further propose a second coded scheme based on Luby transform (LT) codes under inactivation decoding. Interestingly, LT codes may reduce the delay over the partitioned scheme at the expense of an increased communication load. We also consider distributed computing under a deadline and show numerically that the proposed schemes outperform other schemes in the literature, with the LT code-based scheme yielding the best performance for the scenarios considered.en_US
dc.language.isoengeng
dc.publisherIEEEen_US
dc.titleBlock-Diagonal and LT Codes for Distributed Computing with Straggling Serversen_US
dc.typePeer reviewed
dc.typeJournal article
dc.date.updated2020-01-20T15:56:12Z
dc.description.versionacceptedVersionen_US
dc.rights.holderCopyright 2018 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.en_US
dc.identifier.doihttps://doi.org/10.1109/tcomm.2018.2877391
dc.identifier.cristin1711980
dc.source.journalIEEE Transactions on Communications
dc.relation.projectNorges forskningsråd: 240985
dc.relation.projectVetenskapsrådet: 2016-04253
dc.identifier.citationIEEE Transactions on Communications. 2019, 67 (3), 1739-1753.


Tilhørende fil(er)

Thumbnail

Denne innførselen finnes i følgende samling(er)

Vis enkel innførsel