Practice
Learn
← Quit
0 / 0 correct
Distributed Systems
Hard
1 of 10
What is 'probabilistically bounded staleness' (PBS)?
A
A guarantee that reads are never stale
B
A cache eviction policy
C
A model predicting how likely a read returns the latest write after t ms for given N, R, W and latency distributions
D
A clock synchronization method