Rendezvous hashing computes a score for every key-and-node pair and selects the highest-scoring node. All participants with the same node list make the same assignment without storing a separate lookup table.
When a worker joins or leaves, only keys whose winning node changes need reassignment. This makes the method useful for distributing repositories across replaceable workers without permanent primaries.
Acronyms and aliases
HRW hashing acronymhighest random weight hashing synonym
Related terms
Frequently asked questions
How is rendezvous hashing different from consistent hashing?
Both minimize movement when nodes change, but rendezvous hashing ranks nodes per key instead of placing nodes and keys on a hash ring.
Why use rendezvous hashing for repository workers?
It provides deterministic assignment and limited reshuffling as workers scale or fail, without maintaining a fixed primary mapping.
