3 ms·
This is great, although I think these are some pretty advanced high schoolers! It's cool that they are learning this stuff. However, rendezvous hashing is sup
by jedberg 10y ago
This is great, although I think these are some pretty advanced high schoolers! It's cool that they are learning this stuff.
However, rendezvous hashing is superior to consistent hashing because consistent hashing gets hotspots if you lose a node, unless you are using many virtual nodes (which then adds a large overhead). Also, rendezvous hashing doesn't require all the clients to know the state of all the nodes.
So maybe it would be good to update the lesson for rendezvous hashing. :)
- AkshatM 10y agoThank you! Re rendezvous hashing: I would have to understand it better first, and write out an implementation. :) But, yes, maybe in a followup post.
- jedberg 10y agoHere's a video from a talk I did about rendezvous hashing: https://youtu.be/x-zwxuIb1lY?t=20m38s https://youtu.be/x-zwxuIb1lY?t=20m38s Might at least give you a high level overview. Then you can read this Python which is pretty straightforward: https://github.com/nikhilgarg28/rendezvous/blob/master/_rendezvous.py https://github.com/nikhilgarg28/rendezvous/blob/master/_rend... I think you'll like it! :)