Simulating Population Protocols in Sub-Constant Time per Interaction

  title={Simulating Population Protocols in Sub-Constant Time per Interaction},
  author={Petra Berenbrink and David Hammer and Dominik Kaaser and Ulrich Meyer and Manuel Penschuck and Hung Tran},
We consider the problem of efficiently simulating population protocols. In the population model, we are given a distributed system of $n$ agents modeled as identical finite-state machines. In each time step, a pair of agents is selected uniformly at random to interact. In an interaction, agents update their states according to a common transition function. We empirically and analytically analyze two classes of simulators for this model. First, we consider sequential simulators executing one… 

Figures and Tables from this paper

On Truly Parallel Time in Population Protocols
It is shown that when the transition function of a population protocol is treated as a black box then the expected maximum number of parallel steps necessary to implement a round of n interactions is Ω( log n log log log n ).
ppsim: A software package for efficiently simulating and visualizing population protocols
We introduce ppsim [2], a software package for efficiently simulating population protocols, a widely-studied subclass of chemical reaction networks (CRNs) in which all reactions have two reactants
Parallel Weighted Random Sampling
This work gives efficient, fast, and practicable parallel and distributed algorithms for building data structures that support sampling single items (alias tables, compressed data structures), and gives a communication-efficient, highly scalable approach to (weighted and unweighted) reservoir sampling.
Communication-Efficient Probabilistic Algorithms: Selection, Sampling, and Checking
Diese Dissertation behandelt drei grundlegende Klassen von Problemen in Big-Data-Systemen, fur die wir kommunikationseffiziente probabilistische Algorithmen entwickeln. Im ersten Teil betrachten wir


Fast computation by population protocols with a leader
It is shown that when a unique leader agent is provided in the initial population, the population can simulate a virtual register machine with high probability in which standard arithmetic operations like comparison, addition, subtraction, and multiplication and division by constants can be simulated in O(n log5n) interactions.
Almost Logarithmic-Time Space Optimal Leader Election in Population Protocols
This is the fastest currently known leader election algorithm in which each agent utilises asymptotically optimal number of $\bigo(łogłog n)$ states and incorporates and amalgamates successfully the power of assorted synthetic coins with variable rate phase clocks.
Fast and Exact Majority in Population Protocols
This paper presents a new protocol called Average and Conquer (AVC), which shows that the majority problem can be solved exactly in time poly-logarithmic in n, provided that the memory per node is s = s = 1/ε + log n log{1/ε).
Polylogarithmic-Time Leader Election in Population Protocols
The argument combines careful use of concentration inequalities with anti-concentration bounds, showing that the leaders' values become spread apart as the execution progresses, which in turn implies that straggling leaders get quickly eliminated.
Fast Space Optimal Leader Election in Population Protocols
A new fast and robust population protocol for initialisation of phase clocks to be run simultaneously in multiple modes and intertwined with the leader election process, which uses double logarithmic space usage.
An Introduction to Population Protocols
This chapter surveys results that describe what can be computed in various versions of the population protocol model, which can be used to model mobile ad hoc networks of tiny devices or collections of molecules undergoing chemical reactions.
Time-Space Trade-offs in Population Protocols
A unified lower bound is proved, which relates the space available per node with the time complexity achievable by a protocol, and the first result to characterize time complexity for protocols which employ super-constant number of states per node, and it is proved that fast, poly-logarithmic running times require protocols to have relatively large space costs.
Space-Optimal Majority in Population Protocols
A new lower bound of $\Omega(\log n)$ states is provided for any protocol which stabilizes in n^{1-c} ) time, for any $c > 0$ constant, conditional on basic monotonicity and output assumptions, satisfied by all known protocols.
Optimal time and space leader election in population protocols
This paper provides the first leader election population protocol that is both time and space optimal: it uses Θ(loglogn) states per agent, and elects a leader in O(nlogn) interactions in expectation.
An O(log3/2 n) Parallel Time Population Protocol for Majority with O(log n) States
This paper designs a population protocol that solves the majority problem in O(log3/2 n) parallel time, both with high probability and in expectation, while using O( log n) states.