Coded distributed computing execution time equals erasure-channel error probability for linear codes, with explicit expressions for binary random linear codes and asymptotic optimality for binary codes matching any linear code.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Coded Distributed Computing: Performance Limits and Code Designs
Coded distributed computing execution time equals erasure-channel error probability for linear codes, with explicit expressions for binary random linear codes and asymptotic optimality for binary codes matching any linear code.