Josh BeckmanTimestamps produced by a vector clock take the most amount of space compared to other well-known clock designs. The space complexity is O(n). A vector timestamp tracks the id of a node and the last known event id from that node. Therefore, if there are n nodes in the system, the timestamp would be an n-tuple.

Giridhar ManepalliClocks and Causality - Ordering Events in Distributed Systems

### Filed Under

### Same Source

### Same Topic

- The possibilities for using language as an intermediate repr...
- A **Bloom filter** is a space-efficient [probabilistic] [dat...
- > One of the foundations of what explanation *means* for us ...
- Everyone agrees that passwords or secret access tokens requi...
- There’s something qualitative and important that happens whe...
- it's neat how *adding* affine measures is mathematically inv...
- facts incorporate time...
- errors are values...