Name
Abstract | ||
|---|---|---|
AbstractConsider a distributed task where the communication network is fixed but the local inputs given to the nodes of the distributed system may change over time. In this work, we explore the following question: if some of the local inputs change, can an existing solution be updated efficiently, in a dynamic and distributed manner? To address this question, we define the batch dynamic \congest model in which we are given a bandwidth-limited communication network and a dynamic edge labelling defines the problem input. The task is to maintain a solution to a graph problem on the labeled graph under batch changes. We investigate, when a batch of α edge label changes arrive, \beginitemize \item how much time as a function of α we need to update an existing solution, and \item how much information the nodes have to keep in local memory between batches in order to update the solution quickly. \enditemize Our work lays the foundations for the theory of input-dynamic distributed network algorithms. We give a general picture of the complexity landscape in this model, design both universal algorithms and algorithms for concrete problems, and present a general framework for lower bounds. In particular, we derive non-trivial upper bounds for two selected, contrasting problems: maintaining a minimum spanning tree and detecting cliques. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1145/3447384 | Proceedings of the ACM on Measurement and Analysis of Computing Systems |
DocType | Volume | Issue |
Journal | 5 | 1 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Klaus-Tycho Foerster | 1 | 32 | 10.49 |
| Janne H. Korhonen | 2 | 0 | 0.34 |
| Ami Paz | 3 | 2 | 2.07 |
| Joel Rybicki | 4 | 78 | 9.69 |
| Stefan Schmid | 5 | 769 | 79.85 |