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 labelled graph under batch changes. We investigate, when a batch of alpha edge label changes arrive, - how much time as a function of alpha we need to update an existing solution, and - how much information the nodes have to keep in local memory between batches in order to update the solution quickly. 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. The diverse time complexity of our model spans from constant time, through time polynomial in alpha, and to alpha time, which we show to be enough for any task. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1145/3410220.3453923 | Measurement and Modeling of Computer Systems |
DocType | Citations | PageRank |
Conference | 1 | 0.35 |
References | Authors | |
0 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Klaus-Tycho Foerster | 1 | 32 | 10.49 |
| Janne Korhonen | 2 | 71 | 10.52 |
| Ami Paz | 3 | 2 | 2.07 |
| Joel Rybicki | 4 | 78 | 9.69 |
| Stefan Schmid | 5 | 559 | 71.98 |