Lessons from the Congested Clique Applied to MapReduce

DOI10.1007/978-3-319-09620-9_13zbMath1333.68276arXiv1405.4356OpenAlexW2174199856MaRDI QIDQ5496156

James W. Hegeman, Sriram V. Pemmaraju

Publication date: 7 August 2014

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1405.4356

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Distributed algorithms (68W15)

Related Items (5)

Graph reconstruction in the congested clique ⋮ Derandomizing local distributed algorithms under bandwidth restrictions ⋮ Algebraic methods in the congested clique ⋮ Sub-logarithmic distributed algorithms for metric facility location ⋮ The Effect of Range and Bandwidth on the Round Complexity in the Congested Clique Model

This page was built for publication: Lessons from the Congested Clique Applied to MapReduce