The Topology of Randomized Symmetry-Breaking Distributed Computing

05/25/2021
by   Pierre Fraigniaud, et al.
0

Studying distributed computing through the lens of algebraic topology has been the source of many significant breakthroughs during the last two decades, especially in the design of lower bounds or impossibility results for deterministic algorithms. This paper aims at studying randomized synchronous distributed computing through the lens of algebraic topology. We do so by studying the wide class of (input-free) symmetry-breaking tasks, e.g., leader election, in synchronous fault-free anonymous systems. We show that it is possible to redefine solvability of a task "locally", i.e., for each simplex of the protocol complex individually, without requiring any global consistency. However, this approach has a drawback: it eliminates the topological aspect of the computation, since a single facet has a trivial topological structure. To overcome this issue, we introduce a "projection" π of both protocol and output complexes, where every simplex σ is mapped to a complex π(σ); the later has a rich structure that replaces the structure we lost by considering one single facet at a time. To show the significance and applicability of our topological approach, we derive necessary and sufficient conditions for solving leader election in synchronous fault-free anonymous shared-memory and message-passing models. In both models, we consider scenarios in which there might be correlations between the random values provided to the nodes. In particular, different parties might have access to the same randomness source so their randomness is not independent but equal. Interestingly, we find that solvability of leader election relates to the number of parties that possess correlated randomness, either directly or via their greatest common divisor, depending on the specific communication model.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/12/2021

Time and Communication Complexity of Leader Election in Anonymous Networks

We study the problem of randomized Leader Election in synchronous distri...
research
07/08/2019

A Topological Perspective on Distributed Network Algorithms

More than two decades ago, combinatorial topology was shown to be useful...
research
08/05/2021

Lower Bounds for Shared-Memory Leader Election under Bounded Write Contention

This paper gives tight logarithmic lower bounds on the solo step complex...
research
06/02/2019

On the Use of Randomness in Local Distributed Graph Algorithms

We attempt to better understand randomization in local distributed graph...
research
08/10/2020

Communication Efficient Self-Stabilizing Leader Election (Full Version)

This paper presents a randomized self-stabilizing algorithm that elects ...
research
02/20/2012

Deterministic Leader Election Among Disoriented Anonymous Sensors

We address the Leader Election (LE) problem in networks of anonymous sen...
research
11/20/2017

Schlegel Diagram and Optimizable Immediate Snapshot Protocol

In the topological study of distributed systems, the immediate snapshot ...

Please sign up or login with your details

Forgot password? Click here to reset