Genuine atomic multicast in asynchronous distributed systems

DOI10.1016/S0304-3975(99)00161-9MaRDI QIDQ5940924zbMATH OpenWikidataFDO

Authors Rachid Guerraoui, A. Schiper

Publication date 20 August 2001

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0304-3975(99)00161-9

zbMATH Keywords

distributed algorithmsfault-toleranceunreliable failure detectorsatomic multicast

Mathematics Subject Classification ID

Distributed systems (68M14)

Recommendations

• Unreliable failure detectors for reliable distributed systems
• EFFICIENT SOLUTION TO UNIFORM ATOMIC BROADCAST
• On the Inherent Cost of Atomic Broadcast and Multicast in Wide Area Networks
• Real-time atomic multicast algorithms implemented on a shared memory multiprocessor
• Highly concurrent logically synchronous multicast

Cites work

• Genuine atomic multicast in asynchronous distributed systems
• Impossibility of distributed consensus with one faulty process
• The weakest failure detector for solving consensus
• Time, clocks, and the ordering of events in a distributed system
• Unreliable failure detectors for reliable distributed systems

Cited in

(7)

• Genuine atomic multicast in asynchronous distributed systems
• Atomic broadcast in a Byzantine model
• HiperTM: high performance, fault-tolerant transactional memory
• Real-time atomic multicast algorithms implemented on a shared memory multiprocessor
• Uniform atomic broadcast and consensus in fully anonymous synchronous systems with crash failures
• On the Inherent Cost of Atomic Broadcast and Multicast in Wide Area Networks
• Multicasting in the presence of aggregated deliveries

This page was built for publication: Genuine atomic multicast in asynchronous distributed systems

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