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