On the Communication Surplus Incurred by Faulty Processors

DOI10.1007/978-3-540-75142-7_26zbMATH Open1145.68593OpenAlexW1590883019MaRDI QIDQ3523217FDOQ3523217

Authors Dariusz R. Kowalski, Michał Strojnowski

Publication date 2 September 2008

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

Full work available at URL https://doi.org/10.1007/978-3-540-75142-7_26

Mathematics Subject Classification ID

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

Recommendations

• Gossiping by processors prone to omission failures
• Robust gossiping with an application to consensus
• Communication complexity of fault-tolerant information diffusion
• Efficient gossip and robust distributed computation
• Efficient gossip and robust distributed computation

Cited in

(6)

• The cost of fault tolerance in multi-party communication complexity
• Efficient gossip and robust distributed computation
• Confidential gossip
• Gossiping by processors prone to omission failures
• Meeting the deadline: on the complexity of fault-tolerant continuous gossip
• Efficient gossip and robust distributed computation

This page was built for publication: On the Communication Surplus Incurred by Faulty Processors

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