Efficient gossip and robust distributed computation

DOI10.1007/B13831MaRDI QIDQ5897410zbMATH OpenOpenAlexFDO

Authors Chryssis Georgiou, Dariusz R. Kowalski, Alexander A. Schwarzmann

Publication date 23 February 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b13831

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed systems (68M14)

Recommendations

• Efficient gossip and robust distributed computation
• Robust gossiping with an application to consensus
• Time and Communication Efficient Consensus for Crash Failures
• On the Communication Surplus Incurred by Faulty Processors
• On the complexity of asynchronous gossip

Cited in

(15)

• Performing work in broadcast networks
• Efficient gossip and robust distributed computation
• Performing work with asynchronous processors: Message-delay-sensitive bounds
• Almost-optimal gossip-based aggregate computation
• Optimal gossip with direct addressing
• On the Communication Surplus Incurred by Faulty Processors
• Time and Communication Efficient Consensus for Crash Failures
• How efficient can gossip be? (On the cost of resilient information exchange)
• Fast gossiping on mesh-bus computers
• Broadcast Gossip Algorithms for Consensus
• scientific article; zbMATH DE number 7440211 (Why is no real title available?)
• Robust gossip-based aggregation: a practical point of view
• Robust gossiping with an application to consensus
• Parallel algorithms for gossiping by mail
• Two phase gossip: Managing distributed event histories

This page was built for publication: Efficient gossip and robust distributed computation

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