Gossiping by processors prone to omission failures

DOI10.1016/J.IPL.2007.11.022MaRDI QIDQ976104zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

• scientific article; zbMATH DE number 996442 (Why is no real title available?)
• scientific article; zbMATH DE number 819814 (Why is no real title available?)
• Automatically increasing the fault-tolerance of distributed algorithms
• Bounds on information exchange for Byzantine agreement
• Dissemination of information in communication networks. Broadcasting, gossiping, leader election, and fault-tolerance.
• Efficient gossip and robust distributed computation
• On the Communication Surplus Incurred by Faulty Processors
• Ramanujan graphs
• Robust gossiping with an application to consensus

Cited in

(3)

• scientific article; zbMATH DE number 2080226 (Why is no real title available?)
• Bounded time-stamping in message-passing systems
• On the Communication Surplus Incurred by Faulty Processors

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)