Gossiping by processors prone to omission failures

DOI10.1016/j.ipl.2007.11.022zbMath1191.68089OpenAlexW1996864119MaRDI QIDQ976104

Dariusz R. Kowalski, Michał Strojnowski

Publication date: 16 June 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2007.11.022

zbMATH Keywords

algorithmsfault tolerancedistributed computinggossip problemomission failures

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Cites Work

• Unnamed Item
• Unnamed Item
• Robust gossiping with an application to consensus
• Ramanujan graphs
• Dissemination of information in communication networks. Broadcasting, gossiping, leader election, and fault-tolerance.
• Efficient gossip and robust distributed computation
• Automatically increasing the fault-tolerance of distributed algorithms
• On the Communication Surplus Incurred by Faulty Processors
• Bounds on information exchange for Byzantine agreement

This page was built for publication: Gossiping by processors prone to omission failures