A Fast, Minimal Memory, Consistent Hash Algorithm

(2014)

Abstract:

We present jump consistent hash, a fast, minimal memory, consistent hash algorithm that can be expressed in about 5 lines of code. In comparison to the algorithm of Karger et al., jump consistent hash requires no storage, is faster, and does a better job of evenly dividing the key space among the buckets and of evenly dividing the workload when the number of buckets changes. Its main limitation is that the buckets must be numbered sequentially, which makes it more suitable for data storage applications than for distributed web caching.

Authors:

John Lamping, and Eric Veach

Tags:

computer science, algorithm, hashing

Length:

12

Submitted By:

alixander

Date Submitted:

Mar 16, 2015

Favorited:

0

Times Read:

0

Discussion and Questions

roflxss 2 years, 2 months ago
Points: -2

!@#$%^&*()_+LOL<>:)