A Fast, Minimal Memory, Consistent Hash Algorithm (2014) (arxiv.org) 46 points by gbrown_ 7y ago ↗ HN
[–] rubiquity 7y ago ↗ This is the paper about Jump Hashing. A must read on this is Damian Gryski’s post comparing a bunch of consistent hashing algorithms, all with their own sets of trade offs related to speed, balancing, and memory usage.https://medium.com/@dgryski/consistent-hashing-algorithmic-t...
[–] hengestone 7y ago ↗ The authors mention that the algorithm is not patented, and won't be. Wait, can algorithms be patented?! [–] daemin 7y ago ↗ Yes, GIF, MPEG, Arithmetic Coding, all have been patented or parts that comprise them have been patented.
[–] daemin 7y ago ↗ Yes, GIF, MPEG, Arithmetic Coding, all have been patented or parts that comprise them have been patented.
[–] mcguire 7y ago ↗ int32_t JumpConsistentHash(uint64_t key, int32_t num_buckets) { int64_t b = 1, j = 0; while (j < num_buckets) { b = j; key = key * 2862933555777941757ULL + 1; j = (b + 1) * (double(1LL << 31) / double((key >> 33) + 1)); } return b; }
5 comments
[ 3.7 ms ] story [ 21.5 ms ] threadhttps://medium.com/@dgryski/consistent-hashing-algorithmic-t...