Pages that link to "Item:Q1182109"
From MaRDI portal
The following pages link to Concerning the size of logical clocks in distributed systems (Q1182109):
Displayed 10 items.
- The space complexity of unbounded timestamps (Q352241) (← 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)
- Precision, recall, and sensitivity of monitoring partially synchronous distributed programs (Q2241299) (← links)
- Optimal propagation-based protocols implementing causal memories (Q2375309) (← 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)