Necessary and sufficient conditions on information for causal message ordering and their optimal implementation
From MaRDI portal
Publication:5137351
DOI10.1007/s004460050044zbMath1448.68130MaRDI QIDQ5137351
Mukesh Singhal, Ajay D. Kshemkalyani
Publication date: 2 December 2020
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s004460050044
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
68M14: Distributed systems
Related Items
On the diversity of asynchronous communication, Redundancy removal in multicast protocols, Byzantine-tolerant causal broadcast, Crash-tolerant causal broadcast in \(O(n)\) messages, Unnamed Item
Cites Work
- Temporal interactions of intervals in distributed systems.
- The causal ordering abstraction and a simple way to implement it
- An efficient implementation of vector clocks
- Detecting causal relationships in distributed computations: In search of the holy grail
- Time, clocks, and the ordering of events in a distributed system
- Synchronous, asynchronous, and causally ordered communication