The impossibility of implementing reliable communication in the face of crashes

DOI10.1145/174147.169676MaRDI QIDQ4285632zbMATH OpenOpenAlexFDO

Authors

Publication date 11 September 1994

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/174147.169676

zbMATH Keywords

lower boundscommunication networkscommunication protocolformal specificationI/O automataconnection reset

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Specification and verification (program logics, model checking, etc.) (68Q60) Network design and communication in computer systems (68M10)

Recommendations

• The fault span of crash failures
• Impossibility of distributed consensus with one faulty process
• Reliable broadcasts and communication models: tradeoffs and lower bounds
• Possibility and impossibility results in a shared memory environment
• Reliable communication over partially authenticated networks

Cited in

(7)

• Feasibility and complexity of broadcasting with random transmission failures
• \(f\)-sensitivity distance oracles and routing schemes
• Simulating reliable links with unreliable links in the presence of process crashes
• Hundreds of impossibility results for distributed computing
• Highly concurrent logically synchronous multicast
• Scalable eventually consistent counters over unreliable networks
• The fault span of crash failures

This page was built for publication: The impossibility of implementing reliable communication in the face of crashes

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