EFFICIENT SOLUTION TO UNIFORM ATOMIC BROADCAST

DOI10.1142/S0129054102001400MaRDI QIDQ3021981zbMATH OpenOpenAlexFDO

Authors Emmanuelle Anceaume

Publication date 22 June 2005

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129054102001400

zbMATH Keywords

fault-toleranceasynchronous systemsunreliable failure detectorssafety propertyliveness propertyuniform atomic broadcast algorithm

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Network design and communication in computer systems (68M10)

Recommendations

• Unreliable failure detectors for reliable distributed systems
• Uniform consensus is harder than consensus
• scientific article; zbMATH DE number 2013819
• Distributed Computing
• Automata, Languages and Programming

Cites work

• Time, clocks, and the ordering of events in a distributed system

Cited in

(5)

• Uniform reliable broadcast in anonymous distributed systems with fair lossy channels
• scientific article; zbMATH DE number 2013819 (Why is no real title available?)
• Dissecting distributed coordination
• Implementing uniform reliable broadcast with binary consensus in systems with fair-lossy links
• Genuine atomic multicast in asynchronous distributed systems

This page was built for publication: EFFICIENT SOLUTION TO UNIFORM ATOMIC BROADCAST

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