Genuine atomic multicast in asynchronous distributed systems

DOI10.1016/S0304-3975(99)00161-9zbMath0974.68012WikidataQ126777911 ScholiaQ126777911MaRDI QIDQ5940924

Rachid Guerraoui, André Schiper

Publication date: 20 August 2001

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

zbMATH Keywords

fault-toleranceatomic multicastdistributed algorithmsunreliable failure detectors

Mathematics Subject Classification ID

Distributed systems (68M14)

Related Items (3)

Genuine atomic multicast in asynchronous distributed systems ⋮ On the Inherent Cost of Atomic Broadcast and Multicast in Wide Area Networks ⋮ HiperTM: high performance, fault-tolerant transactional memory

Cites Work

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

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