  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.
