Gossiping by processors prone to omission failures

DOI10.1016/J.IPL.2007.11.022zbMATH Open1191.68089OpenAlexW1996864119MaRDI QIDQ976104FDOQ976104

Authors: 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

Recommendations

• On the Communication Surplus Incurred by Faulty Processors
• Robust gossiping with an application to consensus
• Simple and optimal randomized fault-tolerant rumor spreading
• Time and Communication Efficient Consensus for Crash Failures
• Efficient Gossiping by Packets in Networks with Random Faults

zbMATH Keywords

algorithmsdistributed computingfault tolerancegossip problemomission failures

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (3)

• Bounded time-stamping in message-passing systems
• On the Communication Surplus Incurred by Faulty Processors
• Title not available (Why is that?)

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

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