A Fundamental Storage-Communication Tradeoff in Distributed Computing with Straggling Nodes

Abstract : The optimal storage-computation tradeoff is characterized for a MapReduce-like distributed computing system with straggling nodes, where only a part of the nodes can be utilized to compute the desired output functions. The result holds for arbitrary output functions and thus generalizes previous results that restricted to linear functions. Specifically, in this work, we propose a new information-theoretical converse and a new matching coded computing scheme, that we call coded computing for straggling systems (CCS).
Complete list of metadatas

Cited literature [13 references]  Display  Hide  Download

https://hal.telecom-paristech.fr/hal-02288594
Contributor : Qifa Yan <>
Submitted on : Sunday, September 15, 2019 - 5:39:54 AM
Last modification on : Thursday, October 17, 2019 - 12:36:55 PM

File

CCS_ISIT.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02288594, version 1

Citation

Qifa Yan, Michèle Wigger, Sheng Yang, Xiaohu Tang. A Fundamental Storage-Communication Tradeoff in Distributed Computing with Straggling Nodes. 2019. ⟨hal-02288594⟩

Share

Metrics

Record views

25

Files downloads

28