Practical summation via gossip

DOI10.1145/1281100.1281188MaRDI QIDQ5401483zbMATH OpenOpenAlexFDO

Authors Wesley W. Terpstra, Christof Leng, Alejandro Buchmann

Publication date 13 March 2014

Published in Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1281100.1281188

zbMATH Keywords

gossippeer-to-peersimulationsums

Mathematics Subject Classification ID

Distributed systems (68M14) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Analysis of algorithms and problem complexity (68Q25) Distributed algorithms (68W15)

This page was built for publication: Practical summation via gossip

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5401483)