Pages that link to "Item:Q1198011"
From MaRDI portal
The following pages link to An efficient implementation of vector clocks (Q1198011):
Displaying 16 items.
- A limitation of vector timestamps for reconstructing distributed computations (Q293417) (← links)
- \(\operatorname{Log}^{\prime}\) version vector: logging version vectors concisely in dynamic replication (Q765495) (← links)
- Ubiquity of scalar timing with a Poisson clock (Q1193380) (← links)
- Efficient vector time with dynamic process creation and termination (Q1290257) (← links)
- Detecting causal relationships in distributed computations: In search of the holy grail (Q1331790) (← links)
- On the minimal information to encode timestamps in distributed computations. (Q1853128) (← links)
- Efficient dependency tracking for relevant events in concurrent systems (Q1954199) (← links)
- Timestamping messages and events in a distributed system using synchronous communication (Q1954214) (← links)
- Resettable vector clocks (Q2369664) (← links)
- Optimal propagation-based protocols implementing causal memories (Q2375309) (← links)
- A NOTE ON THE DETERMINATION OF THE IMMEDIATE PREDECESSORS IN A DISTRIBUTED COMPUTATION (Q3021991) (← links)
- Necessary and sufficient conditions on information for causal message ordering and their optimal implementation (Q5137351) (← links)
- The power of logical clock abstractions (Q5138510) (← links)
- Analysis of bounds on hybrid vector clocks (Q5363825) (← links)
- Plausible clocks: constant size logical clocks for distributed systems (Q6570912) (← links)
- Detecting causality in the presence of Byzantine processes: the case of synchronous systems (Q6647755) (← links)
