An optimal algorithm for distributed snapshots with causal message ordering
From MaRDI portal
Recommendations
- Recording distributed snapshots based on causal order of message delivery
- Crash-tolerant causal broadcast in \(O(n)\) messages
- Interval approximations of message causality in distributed executions
- An efficient causal ordering algorithm for multicast communication channels
- Repeated snapshots in distributed systems with synchronous communications and their implementation in CSP
- The snap-stabilizing message forwarding algorithm on tree topologies
- An efficient snapshot collection protocol for deterministic mobile distributed systems
Cites work
Cited in
(9)- Causal order delivery in a multicast environment: An improved algorithm
- An efficient causal ordering algorithm for multicast communication channels
- Interval approximations of message causality in distributed executions
- Necessary and sufficient conditions on information for causal message ordering and their optimal implementation
- Distributed snapshots for ad hoc network systems
- Optimal propagation-based protocols implementing causal memories
- scientific article; zbMATH DE number 1953183 (Why is no real title available?)
- A family of optimal termination detection algorithms
- Recording distributed snapshots based on causal order of message delivery
This page was built for publication: An optimal algorithm for distributed snapshots with causal message ordering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1330663)