Lessons from the congested clique applied to MapReduce
type: Item
instance of: scholarly article
title: Lessons from the congested clique applied to MapReduce
zbMATH Open document ID: 1333.68277
author: James W. Hegeman
author: Sriram Pemmaraju
published in: Theoretical Computer Science
publication date: 2015-12-11T00:00:00Z
Mathematics Subject Classification ID: 68W15
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68Q10
zbMATH DE Number: 6520537
zbMATH Keywords: congested clique
zbMATH Keywords: distributed algorithms
zbMATH Keywords: graph coloring
zbMATH Keywords: MapReduce
describes a project that uses: MapReduce
MaRDI profile type: Publication
full work available at URL: j.tcs.2015.09.029
OpenAlex ID: W1863846876
cites work: Super-Fast Distributed Algorithms for Metric Facility Location
cites work: Algebraic methods in the congested clique
cites work: Q3993417
cites work: “Tri, Tri Again”: Finding Triangles and Small Subgraphs in a Distributed Setting
cites work: The communication complexity of distributed task allocation
cites work: On the power of the congested clique model
cites work: A Plant and Warehouse Location Problem
cites work: A Distributed Algorithm for the Facility Location Problem
cites work: Toward optimal bounds in the congested clique, graph connectivity and MST
cites work: Q5363797
cites work: Simple distributed \(\Delta+1\)-coloring of graphs
cites work: Q5417679
cites work: Super-Fast 3-Ruling Sets.
cites work: Optimal deterministic routing and sorting on the congested clique
cites work: Minimum-Weight Spanning Tree Construction in O(log log n) Communication Rounds
cites work: Distributed MST for constant diameter graphs
cites work: Facility location
cites work: Distributed approximation algorithms for weighted shortest paths
cites work: Return of the primal-dual
cites work: Rapid randomized pruning for fast greedy distributed algorithms
cites work: The round complexity of distributed sorting
cites work: Distributed Computing: A Locality-Sensitive Approach
cites work: Symmetry breaking depending on the chromatic number or the neighborhood growth
DOI: 10.1016/J.TCS.2015.09.029
description: scientific article; zbMATH DE number 6520537