Adaptive Massively Parallel Constant-round Tree Contraction

11/02/2021
by   MohammadTaghi Hajiaghayi, et al.
0

Miller and Reif's FOCS'85 classic and fundamental tree contraction algorithm is a broadly applicable technique for the parallel solution of a large number of tree problems. Additionally it is also used as an algorithmic design technique for a large number of parallel graph algorithms. In all previously explored models of computation, however, tree contractions have only been achieved in Ω(log n) rounds of parallel run time. In this work, we not only introduce a generalized tree contraction method but also show it can be computed highly efficiently in O(1/ϵ^3) rounds in the Adaptive Massively Parallel Computing (AMPC) setting, where each machine has O(n^ϵ) local memory for some 0 < ϵ < 1. AMPC is a practical extension of Massively Parallel Computing (MPC) which utilizes distributed hash tables. In general, MPC is an abstract model for MapReduce, Hadoop, Spark, and Flume which are currently widely used across industry and has been studied extensively in the theory community in recent years. Last but not least, we show that our results extend to multiple problems on trees, including but not limited to maximum and maximal matching, maximum and maximal independent set, tree isomorphism testing, and more.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/18/2019

Massively Parallel Computation via Remote Memory Access

We introduce the Adaptive Massively Parallel Computation (AMPC) model, w...
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
07/14/2018

Matching and MIS for Uniformly Sparse Graphs in the Low-Memory MPC Model

The Massively Parallel Computation (MPC) model serves as a common abstra...
research
05/28/2021

Deterministic 3-Coloring of Trees in the Sublinear MPC model

We present deterministic O(log^2 log n) time sublinear Massively Paralle...
research
02/19/2018

Breaking the Linear-Memory Barrier in MPC: Fast MIS on Trees with n^ Memory per Machine

Recently, studying fundamental graph problems in the Massive Parallel Co...
research
05/05/2023

Fast Dynamic Programming in Trees in the MPC Model

We present a deterministic algorithm for solving a wide range of dynamic...
research
12/19/2011

Scenario trees and policy selection for multistage stochastic programming using machine learning

We propose a hybrid algorithmic strategy for complex stochastic optimiza...

Please sign up or login with your details

Forgot password? Click here to reset