A Tight Analysis of the Parallel Undecided-State Dynamics with Two Colors - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2018

A Tight Analysis of the Parallel Undecided-State Dynamics with Two Colors

Résumé

The Undecided-State Dynamics is a well-known protocol for distributed consensus. We analyze it in the parallel PULL communication model on the complete graph with n nodes for the binary case (every node can either support one of two possible colors, or be in the undecided state). An interesting open question is whether this dynamics is an efficient Self-Stabilizing protocol, namely, starting from an arbitrary initial configuration, it reaches consensus quickly (i.e., within a polylogarithmic number of rounds). Previous work in this setting only considers initial color configurations with no undecided nodes and a large bias (i.e., Θ(n)) towards the majority color. In this paper we present an unconditional analysis of the Undecided-State Dynamics that answers to the above question in the affirmative. We prove that, starting from any initial configuration , the process reaches a monochromatic configuration within O(log n) rounds, with high probability. This bound turns out to be tight. Our analysis also shows that, if the initial configuration has bias Ω(√ n log n), then the dynamics converges toward the initial majority color, with high probability. 2012 ACM Subject Classification Theory of computation → Distributed algorithms

Dates et versions

hal-02002476 , version 1 (07-02-2019)

Identifiants

Citer

Andrea Clementi, Mohsen Ghaffari, Luciano Gualà, Emanuele Natale, Francesco Pasquale, et al.. A Tight Analysis of the Parallel Undecided-State Dynamics with Two Colors. 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018), Aug 2018, Liverpool, United Kingdom. ⟨10.4230/LIPIcs.MFCS.2018.28⟩. ⟨hal-02002476⟩
14 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More