The Community for Technology Leaders
2010 IEEE International Conference on Cluster Computing (2010)
Heraklion, Greece
Sept. 20, 2010 to Sept. 24, 2010
ISBN: 978-0-7695-4220-1
pp: 235-244
The MapReduce model uses a barrier between the Map and Reduce stages. This provides simplicity in both programming and implementation. However, in many situations, this barrier hurts performance because it is overly restrictive. Hence, we develop a method to break the barrier in MapReduce in a way that improves efficiency. Careful design of our barrierless MapReduce framework results in equivalent generality and retains ease of programming. We motivate our case with, and experimentally study our barrier-less techniques in, a wide variety of MapReduce applications divided into seven classes. Our experiments show that our approach can achieve better performance times than a traditional MapReduce framework. We achieve a reduction in job completion times that is 25% on average and 87% in the best case.
MapReduce, barrier, Data-intensive computing

N. Zea, A. Verma, R. H. Campbell, B. Cho and I. Gupta, "Breaking the MapReduce Stage Barrier," 2010 IEEE International Conference on Cluster Computing(CLUSTER), Heraklion, Greece, 2010, pp. 235-244.
88 ms
(Ver 3.3 (11022016))