On the Computational Complexity of MapReduce - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2015

On the Computational Complexity of MapReduce

Résumé

In this paper we study the MapReduce Class (MRC) defined by Karloff et al., which is a formal complexity-theoretic model of MapRe-duce. 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.
Fichier principal
Vignette du fichier
93630001.pdf (308.73 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01199793 , version 1 (16-09-2015)

Identifiants

Citer

Benjamin Fish, Jeremy Kun, Ádám Lelkes, Lev Reyzin, György Turán. On the Computational Complexity of MapReduce. DISC 2015, Toshimitsu Masuzawa; Koichi Wada, Oct 2015, Tokyo, Japan. ⟨10.1007/978-3-662-48653-5_1⟩. ⟨hal-01199793⟩

Collections

DISC2015
77 Consultations
288 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More