2 ms·
Using "Consistent Hash" [1], for instance. > Consistent hashing is a very simple solution to a common problem: how can you find a server in a distributed syste
by slig 11y ago
Using "Consistent Hash" [1], for instance.
> Consistent hashing is a very simple solution to a common problem: how can you find a server in a distributed system to store or retrieve a value identified by a key, while at the same time being able to cope with server failures and network partitions? [2]
[1]: http://en.wikipedia.org/wiki/Consistent_hashing http://en.wikipedia.org/wiki/Consistent_hashing
[2]: http://www.martinbroadhurst.com/Consistent-Hash-Ring.html http://www.martinbroadhurst.com/Consistent-Hash-Ring.html
- TheLoneWolfling 11y agoHuh. I wonder if a consistent hash + remalloc would be faster than a standard hashmap for frequent insertions/deletions.