The distributed complexity of locally checkable problems on paths is decidable

11/05/2018
by   Alkida Balliu, et al.
0

Consider a computer network that consists of a path with n nodes. The nodes are labeled with inputs from a constant-sized set, and the task is to find output labels from a constant-sized set subject to some local constraints---more formally, we have an LCL (locally checkable labeling) problem. How many communication rounds are needed (in the standard LOCAL model of computing) to solve this problem? It is well known that the answer is always either O(1) rounds, or Θ(^* n) rounds, or Θ(n) rounds. In this work we show that this question is decidable (albeit PSPACE-hard): we present an algorithm that, given any LCL problem defined on a path, outputs the distributed computational complexity of this problem and the corresponding asymptotically optimal algorithm.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/18/2019

How much does randomness help with locally checkable problems?

Locally checkable labeling problems (LCLs) are distributed graph problem...
research
02/18/2021

Locally Checkable Problems in Rooted Trees

Consider any locally checkable labeling problem Π in rooted regular tree...
research
05/12/2021

Locally Checkable Labelings with Small Messages

A rich line of work has been addressing the computational complexity of ...
research
08/04/2022

Computing Power of Hybrid Models in Synchronous Networks

During the last two decades, a small set of distributed computing models...
research
01/28/2021

Security, Fault Tolerance, and Communication Complexity in Distributed Systems

We present efficient and practical algorithms for a large, distributed s...
research
04/16/2019

Distributed Computing in the Asynchronous LOCAL model

The LOCAL model is among the main models for studying locality in the fr...
research
07/09/2019

Randomized Constraints Consensus for Distributed Robust Mixed-Integer Programming

In this paper, we consider a network of processors aiming at cooperative...

Please sign up or login with your details

Forgot password? Click here to reset