Brief Announcement: Semi-MapReduce Meets Congested Clique

02/28/2018
by   Soheil Behnezhad, et al.
0

Graph problems are troublesome when it comes to MapReduce. Typically, to be able to design algorithms that make use of the advantages of MapReduce, assumptions beyond what the model imposes, such as the density of the input graph, are required. In a recent shift, a simple and robust model of MapReduce for graph problems, where the space per machine is set to be O(|V|) has attracted considerable attention. We term this model semi-MapReduce, or in short, semi-MPC, and focus on its computational power. In this short note, we show through a set of simulation methods that semi-MPC is, perhaps surprisingly, almost equivalent to the congested clique model of distributed computing. However, semi-MPC, in addition to round complexity, incorporates another practically important dimension to optimize: the number of machines. Furthermore, we show that algorithms in other distributed computing models, such as CONGEST, can be simulated to run in the same number of rounds of semiMPC while also using an optimal number of machines. We later show the implications of these simulation methods by obtaining improved algorithms for these models using the recent algorithms that have been developed.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/26/2020

Sample-and-Gather: Fast Ruling Set Algorithms in the Low-Memory MPC Model

Motivated by recent progress on symmetry breaking problems such as maxim...
research
09/24/2020

Parallel Graph Algorithms in Constant Adaptive Rounds: Theory meets Practice

We study fundamental graph problems such as graph connectivity, minimum ...
research
08/25/2018

Simple Graph Coloring Algorithms for Congested Clique and Massively Parallel Computation

We present a very simple randomized partitioning procedure for graph col...
research
11/15/2018

Large-Scale Distributed Algorithms for Facility Location with Outliers

This paper presents fast, distributed, O(1)-approximation algorithms for...
research
09/13/2020

Simple, Deterministic, Constant-Round Coloring in the Congested Clique

We settle the complexity of the (Δ+1)-coloring and (Δ+1)-list coloring p...
research
10/21/2018

Distributed Approximate Distance Oracles

Data structures that allow efficient distance estimation (distance oracl...
research
07/11/2019

Walking Randomly, Massively, and Efficiently

We introduce an approach that enables for efficiently generating many in...

Please sign up or login with your details

Forgot password? Click here to reset