On the complexity of asynchronous gossip

DOI10.1145/1400751.1400771MaRDI QIDQ2934340zbMATH OpenOpenAlexFDO

Authors Chryssis Georgiou, Dariusz R. Kowalski, Rachid Guerraoui, Seth Gilbert

Publication date 12 December 2014

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

Full work available at URL http://infoscience.epfl.ch/record/124981

zbMATH Keywords

adaptive versus oblivious adversaryasynchronycomplexityconsensusepidemicgossiprandomization

Mathematics Subject Classification ID

Network protocols (68M12) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Distributed algorithms (68W15)

Recommendations

• Amenable absorption in amalgamated free product von Neumann algebras
• Amenability, tubularity, and embeddings into \(\mathcal{R}^{\omega}\)
• Factoriality, Connes' type III invariants and fullness of amalgamated free product von Neumann algebras
• Co-amenability and Connes's embedding problem
• The amalgamated free product of hyperfinite von Neumann algebras over finite dimensional subalgebras

Cited in

(17)

• Note on the problem of gossiping in multidimensional grids
• The partial gossiping problem
• Communication-efficient randomized consensus
• Efficient gossip and robust distributed computation
• Communication complexity of consensus in anonymous message passing systems
• An asynchronous randomized gossip consensus algorithm with nonuniform-selected probability and optimization
• On gossip and populations
• Time and Communication Efficient Consensus for Crash Failures
• How efficient can gossip be? (On the cost of resilient information exchange)
• scientific article; zbMATH DE number 7561259 (Why is no real title available?)
• Meeting the deadline, on the complexity of fault-tolerant \textsc{Continuous Gossip}
• Asynchronous gossip
• Order optimal information spreading using algebraic gossip
• Efficient gossip and robust distributed computation
• Meeting the deadline: on the complexity of fault-tolerant continuous gossip
• Parallel algorithms for gossiping by mail
• Two phase gossip: Managing distributed event histories

This page was built for publication: On the complexity of asynchronous gossip

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