• DocumentCode
    2548944
  • Title

    Breaking the MapReduce Stage Barrier

  • Author

    Verma, Abhishek ; Zea, Nicolas ; Cho, Brian ; Gupta, Indranil ; Campbell, Roy H.

  • Author_Institution
    Dept. of Comput. Sci., Univ. of Illinois at Urbana-Champaign, Urbana, IL, USA
  • fYear
    2010
  • fDate
    20-24 Sept. 2010
  • Firstpage
    235
  • Lastpage
    244
  • Abstract
    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.
  • Keywords
    distributed programming; functional programming; MapReduce stage barrier; barrier breaking; efficiency improvement; programming efficiency; Aggregates; Context; Data structures; Google; Memory management; Sorting; Training; Data-intensive computing; MapReduce; barrier;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Cluster Computing (CLUSTER), 2010 IEEE International Conference on
  • Conference_Location
    Heraklion, Crete
  • Print_ISBN
    978-1-4244-8373-0
  • Electronic_ISBN
    978-0-7695-4220-1
  • Type

    conf

  • DOI
    10.1109/CLUSTER.2010.29
  • Filename
    5600302