DeepAI AI Chat
Log In Sign Up

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

by   Krzysztof Nowicki, et al.
Akademia Sztuk Pięknych we Wrocławiu

We study dynamic graph algorithms in the Massively Parallel Computation model (MPC), inspired by practical data processing systems. Our goal is to provide algorithms that can efficiently handle large batches of edge insertions and deletions. We show algorithms that require fewer rounds to update a solution to problems such as Minimum Spanning Forest and Maximal Matching than would be required by their static counterparts to compute it from scratch. They work in the most restrictive memory regime, in which local memory per machine is strongly sublinear in the number of graph vertices. Improving on the size of the batch they can handle would improve on the round complexity of known static algorithms on sparse graphs. More precisely, we provide O(1) round algorithms that can process a batch of updated of size O(S) for the Minimum Spanning Forest problem and a batch of updates of size O(S^1-ε) for the Maximal Matching problem, where S is the limit on the local memory of a single machine.


page 1

page 2

page 3

page 4


Massively Parallel Symmetry Breaking on Sparse Graphs: MIS and Maximal Matching

The success of massively parallel computation (MPC) paradigms such as Ma...

Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds

In this paper we study the problem of dynamically maintaining graph prop...

How fast can you update your MST? (Dynamic algorithms for cluster computing)

Imagine a large graph that is being processed by a cluster of computers,...

Parallel Minimum Spanning Forest Computation using Sparse Matrix Kernels

Formulations of graph algorithms using sparse linear algebra have yielde...

Input-dynamic distributed graph algorithms for congested networks

Consider a distributed system, where the topology of the communication n...

Parallel Batch-Dynamic Minimum Spanning Forest and the Efficiency of Dynamic Agglomerative Graph Clustering

Hierarchical agglomerative clustering (HAC) is a popular algorithm for c...

Massively Parallel Computation in a Heterogeneous Regime

Massively-parallel graph algorithms have received extensive attention ov...