Resolvable designs from single parity-check codes shrink the file and job counts of coded distributed computing while preserving its communication-load benefit.
ishuffle: Improving hadoop performance with shuffle-on-write,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DC 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Resolvable Designs for Speeding up Distributed Computing
Resolvable designs from single parity-check codes shrink the file and job counts of coded distributed computing while preserving its communication-load benefit.