Plurality consensus in arbitrary graphs : lessons learned from load balancing.

DOI10.4230/LIPICS.ESA.2016.10zbMath1397.68014arXiv1602.01342OpenAlexW2546217121MaRDI QIDQ4606279

Peter Kling, Chris Wastell, Frederik Mallmann-Trenn, Petra Berenbrink, Tom Friedetzky

Publication date: 2 March 2018

Full work available at URL: https://arxiv.org/abs/1602.01342

zbMATH Keywords

load balancingdistributed computingplurality consensus

Mathematics Subject Classification ID

Distributed systems (68M14) Network protocols (68M12)

Related Items (2)

A Population Protocol for Exact Majority with O(log5/3 n) Stabilization Time and Theta(log n) States ⋮ Noisy rumor spreading and plurality consensus

This page was built for publication: Plurality consensus in arbitrary graphs : lessons learned from load balancing.