Vector time and causality among abstract events in distributed computations
From MaRDI portal
(Redirected from Publication:5137346)
Recommendations
Cited in
(21)- A framework for viewing atomic events in distributed computations
- Concerning the size of logical clocks in distributed systems
- Detecting causal relationships in distributed computations: In search of the holy grail
- Interval consistency of asynchronous distributed computations
- On the minimal information to encode timestamps in distributed computations.
- Timestamping messages and events in a distributed system using synchronous communication
- Causal computational complexity of distributed processes
- String realizers of posets with applications to distributed computing
- A limitation of vector timestamps for reconstructing distributed computations
- A NOTE ON THE DETERMINATION OF THE IMMEDIATE PREDECESSORS IN A DISTRIBUTED COMPUTATION
- Beyond Lamport's Happened-before
- Understanding Distributed Program Behavior Using a Multicast Communication Scheme
- scientific article; zbMATH DE number 1286115 (Why is no real title available?)
- From the happened-before relation to the causal ordered set abstraction
- scientific article; zbMATH DE number 1844511 (Why is no real title available?)
- Orthogonal relations for reasoning about posets
- Interval approximations of message causality in distributed executions
- Read-write causality
- Causality and atomicity in distributed computations
- Effectiveness of delaying timestamp computation
- Logical time in distributed software systems
This page was built for publication: Vector time and causality among abstract events in distributed computations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5137346)