Efficient plurality consensus, or: The benefits of cleaning up from time to time - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2016

Efficient plurality consensus, or: The benefits of cleaning up from time to time

Résumé

Plurality consensus considers a network of n nodes, each having one of k opinions. Nodes execute a (randomized) distributed protocol with the goal that all nodes adopt the plurality (the opinion initially supported by the most nodes). Communication is realized via the Gossip (or random phone call) model. A major open question has been whether there is a protocol for the complete graph that converges (w.h.p.) in polylogarithmic time and uses only polylogarithmic memory per node (local memory). We answer this question affirmatively. We propose two protocols that need only mild assumptions on the bias in favor of the plurality. As an example of our results, consider the complete graph and an arbitrarily small constant multiplicative bias in favor of the plurality. Our first protocol achieves plurality consensus in O(logk·loglogn) rounds using logk + Θ(loglogk) bits of local memory. Our second protocol achieves plurality consensus in O(logn·loglogn) rounds using only logk + 4 bits of local memory. This disproves a conjecture by Becchetti et al. (SODA'15) implying that any protocol with local memory logk+O(1) has worst-case runtime Ω(k). We provide similar bounds for much weaker bias assumptions. At the heart of our protocols lies an undecided state, an idea introduced by Angluin et al. (Distributed Computing'08).
Fichier principal
Vignette du fichier
icalp2016_plurality.pdf (695.83 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01353690 , version 1 (12-08-2016)

Identifiants

Citer

Petra Berenbrink, Tom Friedetzky, George Giakkoupis, Peter Kling. Efficient plurality consensus, or: The benefits of cleaning up from time to time. 43rd International Colloquium on Automata, Languages and Programming (ICALP 2016), Jul 2016, Rome, Italy. ⟨10.4230/LIPIcs.ICALP.2016.136⟩. ⟨hal-01353690⟩
542 Consultations
346 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More