BSP vs MapReduce
BSP vs MapReduce
复制标题
BSP 与 MapReduce
DOI：
10.1016/j.procs.2012.04.026
复制
发表时间：
2012
期刊：
影响因子：
--
通讯作者：
Matthew Felice Pace
中科院分区：
文献类型：
--
作者：
Matthew Felice Pace
MapReduce框架已经在很多领域引起了人们的兴趣。它已被广泛应用于工业，并已被用于解决学术界的一些重要问题。将MapReduce置于强大的理论基础之上对于理解其功能至关重要。这项工作将MapReduce与BSP计算模型联系起来，强调了BSP与现代并行算法设计的相关性，并定义了可以在MapReduce中有效实现的BSP算法的子类。
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.