Pages that link to "Item:Q1182109"
From MaRDI portal
The following pages link to Concerning the size of logical clocks in distributed systems (Q1182109):
Displaying 18 items.
- A limitation of vector timestamps for reconstructing distributed computations (Q293417) (← links)
- The space complexity of unbounded timestamps (Q352241) (← links)
- A distributed algorithm to prevent mutual drift between n logical clocks (Q1089788) (← links)
- An efficient implementation of vector clocks (Q1198011) (← 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)
- Precision, recall, and sensitivity of monitoring partially synchronous distributed programs (Q2241299) (← links)
- Optimal propagation-based protocols implementing causal memories (Q2375309) (← links)
- String realizers of posets with applications to distributed computing (Q2787668) (← links)
- Understanding Distributed Program Behavior Using a Multicast Communication Scheme (Q3613478) (← links)
- Interval approximations of message causality in distributed executions (Q5096795) (← links)
- The power of logical clock abstractions (Q5138510) (← links)
- Analysis of bounds on hybrid vector clocks (Q5363825) (← links)
- Logical time in distributed software systems (Q6483318) (← 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)
