A MapReduce fault-tolerance scheme that captures state from the last shuffle's network messages, adding only 1/(p-1) communication overhead and recovering in about 1/p of a step's time.
Cray Users Group (CUG) 19, 45–74 (2010)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DC 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Scalable Fault-Tolerant MapReduce
A MapReduce fault-tolerance scheme that captures state from the last shuffle's network messages, adding only 1/(p-1) communication overhead and recovering in about 1/p of a step's time.