| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 486689 | Procedia Computer Science | 2012 | 10 Pages |
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 deļ¬ning a subclass of BSP algorithms that can be efficiently implemented in MapReduce.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
