An O(log^3/2n) Parallel Time Population Protocol for Majority with O(log n) States

11/25/2020
by   Stav Ben Nun, et al.
0

In population protocols, the underlying distributed network consists of n nodes (or agents), denoted by V, and a scheduler that continuously selects uniformly random pairs of nodes to interact. When two nodes interact, their states are updated by applying a state transition function that depends only on the states of the two nodes prior to the interaction. The efficiency of a population protocol is measured in terms of both time (which is the number of interactions until the nodes collectively have a valid output) and the number of possible states of nodes used by the protocol. By convention, we consider the parallel time cost, which is the time divided by n. In this paper we consider the majority problem, where each node receives as input a color that is either black or white, and the goal is to have all of the nodes output the color that is the majority of the input colors. We design a population protocol that solves the majority problem in O(log^3/2n) parallel time, both with high probability and in expectation, while using O(log n) states. Our protocol improves on a recent protocol of Berenbrink et al. that runs in O(log^5/3n) parallel time, both with high probability and in expectation, using O(log n) states.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/14/2018

A population protocol for exact majority with O(^5/3 n) stabilization time and asymptotically optimal number of states

A population protocol can be viewed as a sequence of pairwise interactio...
research
09/18/2020

Approximate Majority With Catalytic Inputs

Third-state dynamics (Angluin et al. 2008; Perron et al. 2009) is a well...
research
07/01/2020

On the Distributed Construction of Stable Networks in Polylogarithmic Parallel Time

We study the class of networks which can be created in polylogarithmic p...
research
06/24/2021

Self-Stabilizing Phase Clocks and the Adaptive Majority Problem

We present a self-stabilising phase clock for population protocols. In t...
research
03/22/2020

Distributed Computation with Continual Population Growth

Computing with synthetically modified bacteria is a vibrant and active f...
research
03/13/2020

Robust Comparison in Population Protocols

There has recently been a surge of interest in the computational and com...
research
08/26/2021

On Truly Parallel Time in Population Protocols

The parallel time of a population protocol is defined as the average num...

Please sign up or login with your details

Forgot password? Click here to reset