Towards a Complexity Classification of LCL Problems in Massively Parallel Computation

  title={Towards a Complexity Classification of LCL Problems in Massively Parallel Computation},
  author={Sebastian Brandt and Rustam Latypov and Jara Uitto},
In this work, we develop the low-space Massively Parallel Computation (MPC) complexity landscape for a family of fundamental graph problems on trees. We present a general method that solves most locally checkable labeling (LCL) problems exponentially faster in the low-space MPC model than in the LOCAL message passing model. In particular, we show that all solvable LCL problems on trees can be solved in O(log n) time (high-complexity regime) and that all LCL problems on trees with deterministic… 

Figures from this paper


Locally Checkable Labelings with Small Messages
The landscape of LCL complexities under bandwidth restrictions is studied, showing that on trees, the CONGEST complexity of an LCL problem is asymptotically equal to its complexity in the LOCAL model, and for general graphs this equivalence does not hold.
Improved Deterministic (Δ+1) Coloring in Low-Space MPC
The Chang-Li-Pettie algorithm runs in T_local =poly(loglog n) rounds, which sets the state-of-the-art randomized round complexity for the problem in the local model, and employs a combination of tools, notably pseudorandom generators (PRG) and bounded-independence hash functions.
The Complexity Landscape of Distributed Locally Checkable Problems on Trees
The proof is constructive in the sense that it offers a sequential algorithm that decides which side of the gap a given LCL problem belongs to, and shows that it is EXPTIME-hard to distinguish between $\Theta(1)$-round and $\ theta(n) $-round LCL problems on bounded-degree trees.
A Time Hierarchy Theorem for the LOCAL Model
  • Yi-Jun Chang, Seth Pettie
  • Computer Science, Mathematics
    2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)
  • 2017
It is proved that any randomized algorithm that solves an LCL problem in sublogarithmic time can be sped up to run in O(T_{LLL}) time, which is the complexity of the distributed Lovasz local lemma problem, currently known to be Ω( log log n) and 2^{O(sqrt{log log n})} on bounded degree graphs.
Massively Parallel Computation of Matching and MIS in Sparse Graphs
This work considers maximal matching and maximal independent set problems in the MPC model, and a degree reduction technique is used that reduces these problems in graphs with arboricity λ to the corresponding problems inGraphs with maximum degree poly(λ, log n) in O(log2log n) rounds, giving rise to O(√ log λ ⋅ loglog λ + log 2 log n)-round algorithms.
The Complexity of (Δ+1) Coloring in Congested Clique, Massively Parallel Computation, and Centralized Local Computation
New randomized algorithms that improve the complexity of the classic (Δ+1)-coloring problem, and its generalization (� Δ+1-list-coloring, in three well-studied models of distributed, parallel, and centralized computation: Distributed Congested Clique, Centralized Local Computation and Massively Parallel Computation.
An Improved Distributed Algorithm for Maximal Independent Set
A very simple randomized algorithm providing a near-optimal local complexity of O(log deg(v) + log 1/e) rounds, with probability at least 1, which incidentally, when combined with some known techniques, also leads to a near -optimal global complexity.
Sparsifying Distributed Algorithms with Ramifications in Massively Parallel Computation and Centralized Local Computation
We introduce a method for sparsifying distributed algorithms and exhibit how it leads to improvements that go past known barriers in two algorithmic settings of large-scale graph processing:
Improved MPC Algorithms for MIS, Matching, and Coloring on Trees and Beyond.
We present $O(\log\log n)$ round scalable Massively Parallel Computation algorithms for maximal independent set and maximal matching, in trees and more generally graphs of bounded arboricity, as well
Hardness of Minimal Symmetry Breaking in Distributed Computing
It is shown that weak 2-coloring is a minimal distributed symmetry-breaking problem for regular even-degree trees and high-girth graphs, and a tight lower bound of Ω(log ⋅ n) is proved for the distributed computational complexity of weak 2 -coloring in regular trees.