Found in
distributed systems
Articles
SYS
Algorithm
Consistent hashing
Spreads keys over servers so that adding a server moves only its share.
O(log(N·v)) to find a server
1 problem
SYS
Technique
Retry with jitter
The pause before a retry doubles and is chosen at random: clients spread out in time and do not hit the server in waves.
O(1) per pause decision
2 problems
SYS
Data structure
CRDT
Data whose copies are edited independently and merged in any order: counters, sets, text.
O(1) per operation for a counter and a set; insertion into text O(1) on average
2 problems
Problems
Often together
in production 3 load balancing 2 replication 2 databases 2 interviews 2 caching 1 hashing 1 distributed 1 randomized 1 scheduling 1 rate limiting 1 networks 1