Practical summation via gossip

Authors:
Wesley W. Terpstra;Christof Leng;Alejandro P. Buchmann
Affiliations:
Technische Universität Darmstadt, Darmstadt, Germany;Technische Universität Darmstadt, Darmstadt, Germany;Technische Universität Darmstadt, Darmstadt, Germany
Venue:
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Year:
2007

Citing 4
Cited 4

Gossip-Based Computation of Aggregate Information

FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Computing separable functions via gossip

Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Peer counting and sampling in overlay networks: random walk methods

Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Bubblestorm: resilient, probabilistic, and exhaustive peer-to-peer search

Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications

Bubblestorm: resilient, probabilistic, and exhaustive peer-to-peer search

Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Fast summation via sampling in large-scale sensor networks

ACM SIGMOBILE Mobile Computing and Communications Review
Distributed SQL queries with BubbleStorm

From active data management to event-based systems and more
Decentralized monitoring in peer-to-peer systems

Benchmarking Peer-to-Peer Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Distributed summation is computed in asymptotically minimal rounds by Kempe et al's Push-Sum algorithm. Unfortunately it has minor problems in practise, resolved here.