Practice
Learn
← Quit
0 / 0 correct
Distributed Systems
Hard
1 of 10
What is rendezvous (highest random weight) hashing?
A
Picking a node at random each time
B
Assigning keys alphabetically
C
Hashing keys into a ring
D
For each key, compute a hash with every node and pick the node with the highest score