DeepAI AI Chat
Log In Sign Up

Massively Parallel Computation in a Heterogeneous Regime

by   Orr Fischer, et al.
Tel Aviv University

Massively-parallel graph algorithms have received extensive attention over the past decade, with research focusing on three memory regimes: the superlinear regime, the near-linear regime, and the sublinear regime. The sublinear regime is the most desirable in practice, but conditional hardness results point towards its limitations. In this work we study a heterogeneous model, where the memory of the machines varies in size. We focus mostly on the heterogeneous setting created by adding a single near-linear machine to the sublinear MPC regime, and show that even a single large machine suffices to circumvent most of the conditional hardness results for the sublinear regime: for graphs with n vertices and m edges, we give (a) an MST algorithm that runs in O(loglog(m/n)) rounds; (b) an algorithm that constructs an O(k)-spanner of size O(n^1+1/k) in O(1) rounds; and (c) a maximal-matching algorithm that runs in O(√(log(m/n))loglog(m/n)) rounds. We also observe that the best known near-linear MPC algorithms for several other graph problems which are conjectured to be hard in the sublinear regime (minimum cut, maximal independent set, and vertex coloring) can easily be transformed to work in the heterogeneous MPC model with a single near-linear machine, while retaining their original round complexity in the near-linear regime. If the large machine is allowed to have superlinear memory, all of the problems above can be solved in O(1) rounds.


page 1

page 2

page 3

page 4


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

Motivated by recent progress on symmetry breaking problems such as maxim...

Deterministic 3-Coloring of Trees in the Sublinear MPC model

We present deterministic O(log^2 log n) time sublinear Massively Paralle...

Massively Parallel Algorithms for Distance Approximation and Spanners

Over the past decade, there has been increasing interest in distributed/...

Dynamic Graph Algorithms with Batch Updates in the Massively Parallel Computation Model

We study dynamic graph algorithms in the Massively Parallel Computation ...

Massively Parallel Computation and Sublinear-Time Algorithms for Embedded Planar Graphs

While algorithms for planar graphs have received a lot of attention, few...

An Efficient Construction of Yao-Graph in Data-Distributed Settings

A sparse graph that preserves an approximation of the shortest paths bet...

Massively Parallel Algorithms for Finding Well-Connected Components in Sparse Graphs

A fundamental question that shrouds the emergence of massively parallel ...