TL;DR
This paper establishes a theoretical connection between the MapReduce framework and the BSP model, highlighting how BSP can inform the design of efficient MapReduce algorithms.
Contribution
It links MapReduce to the BSP model, defining a subclass of BSP algorithms suitable for efficient implementation in MapReduce.
Findings
BSP provides a strong theoretical foundation for MapReduce.
A subclass of BSP algorithms can be efficiently implemented in MapReduce.
This connection aids in designing better parallel algorithms for MapReduce.
Abstract
The MapReduce framework has been generating a lot of interest in a wide range of areas. It has been widely adopted in industry and has been used to solve a number of non-trivial problems in academia. Putting MapReduce on strong theoretical foundations is crucial in understanding its capabilities. This work links MapReduce to the BSP model of computation, underlining the relevance of BSP to modern parallel algorithm design and defining a subclass of BSP algorithms that can be efficiently implemented in MapReduce.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.