Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

STOCHASTIC ANALYSIS OF AVERAGE BASED DISTRIBUTED ALGORITHMS

Yves Mocquard 1 Bruno Sericola 2 Frédérique Robin 3 Emmanuelle Anceaume 3
2 DIONYSOS - Dependability Interoperability and perfOrmance aNalYsiS Of networkS
Inria Rennes – Bretagne Atlantique , IRISA-D2 - RÉSEAUX, TÉLÉCOMMUNICATION ET SERVICES
3 CIDRE - Confidentialité, Intégrité, Disponibilité et Répartition
CentraleSupélec, Inria Rennes – Bretagne Atlantique , IRISA-D1 - SYSTÈMES LARGE ÉCHELLE
Abstract : We analyse average-based distributed algorithms relying on simple and pairwise random interactions among a large and unknown number of anonymous agents. This allows the characterization of global properties emerging from these local interactions. Agents start with an initial integer value, and at each interaction keep the average integer part of both values as their new value. The convergence occurs when, with high probability, all the agents possess the same value which means that they all know a property of the global system. Using a well chosen stochastic coupling, we improve upon existing results by providing explicit and tight bounds of the convergence time. We apply these general results to both the proportion problem and the system size problem.
Complete list of metadatas

Cited literature [10 references]  Display  Hide  Download

https://hal-cnrs.archives-ouvertes.fr/hal-02473856
Contributor : Emmanuelle Anceaume <>
Submitted on : Tuesday, February 11, 2020 - 9:00:29 AM
Last modification on : Tuesday, February 25, 2020 - 8:08:10 AM

File

main_JAP.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02473856, version 1

Citation

Yves Mocquard, Bruno Sericola, Frédérique Robin, Emmanuelle Anceaume. STOCHASTIC ANALYSIS OF AVERAGE BASED DISTRIBUTED ALGORITHMS. 2020. ⟨hal-02473856⟩

Share

Metrics

Record views

20

Files downloads

13