Abstract
In this paper we study the MapReduce Class (MRC) defined by Karloff et al., which is a formal complexity-theoretic model of MapReduce. We show that constant-round MRC computations can decide regular languages and simulate sublogarithmic space-bounded Turing machines. In addition, we prove hierarchy theorems for MRC under certain complexity-theoretic assumptions. These theorems show that sufficiently increasing the number of rounds or the amount of time per processor strictly increases the computational power of MRC. Our work lays the foundation for further analysis relating MapReduce to established complexity classes. Our results also hold for Valiant’s BSP model of parallel computation and the MPC model of Beame et al.
Cite
CITATION STYLE
Fish, B., Kun, J., Lelkes, Á. D., Reyzin, L., & Turán, G. (2015). On the computational complexity of MapReduce. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9363, pp. 1–15). Springer Verlag. https://doi.org/10.1007/978-3-662-48653-5_1
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
