Google Research: Allocating critical load using a consistent hash algorithm

Load balancing
evenly
dynamic
consistent






Mikkel Thorup
Strictly to ensure
Google Cloud Pub/Sub
A consistent hash algorithm is used to allocate critical load






Vimeo
haproxy
post
and










background



A consistent hash algorithm












uniformity
consistency
dynamic






algorithm



The process of throwing a ball into a garbage can at random
Minimum or maximum
















Our paper
²

Load distribution under different ε values. For all ranges of loads (from 0 to (1+ε) times the mean load), the load distribution was nearly uniform, with many bins having loads equal to (1+ε) times the mean load.

Open source
The paper
NYC Algorithm Team






Thank you:



Mikkel Thorup