Causal broadcast: how to forget?

DOI10.4230/LIPICS.OPODIS.2018.20MaRDI QIDQ5091096zbMATH OpenFDO

Authors Brice Nédelec, Pascal Molli, Achour Mostáfaoui

Publication date 21 July 2022

Full work available at URL https://doi.org/10.4230/LIPICS.OPODIS.2018.20

zbMATH Keywords

causal broadcastcomplexity trade-offlarge and dynamic systems

Mathematics Subject Classification ID

Distributed systems (68M14) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Byzantine-tolerant causal broadcast
• Crash-tolerant causal broadcast in \(O(n)\) messages
• scientific article; zbMATH DE number 1292975
• On reversibility and broadcast
• Causal memory: definitions, implementation, and programming

Cites work

• Concise version vectors in WinFS
• Detecting causal relationships in distributed computations: In search of the holy grail
• Distributed Algorithms for Message-Passing Systems
• scientific article; zbMATH DE number 2080512 (Why is no real title available?)
• T-Man: Gossip-based fast overlay topology construction
• Time, clocks, and the ordering of events in a distributed system
• Wait-freedom vs. t-resiliency and the robustness of wait-free hierarchies (extended abstract)

This page was built for publication: Causal broadcast: how to forget?

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