Skip to content
This repository

HTTPS clone URL

Subversion checkout URL

You can clone with HTTPS or Subversion.

Download ZIP

Fairly assign cacheable entities to cache hosts

branch: master

fix broken .cabal file

latest commit 526b175c18
brad clawsie authored November 19, 2012
Octocat-spinner-32 Data changes for submission to hackage October 18, 2012
Octocat-spinner-32 .gitignore Initial commit October 15, 2012
Octocat-spinner-32 Data-Hash-Consistent.cabal fix broken .cabal file November 19, 2012
Octocat-spinner-32 LICENSE initial commit October 15, 2012
Octocat-spinner-32 README.md initial commit October 15, 2012
Octocat-spinner-32 Setup.lhs initial commit October 15, 2012
Octocat-spinner-32 example.hs changes for submission to hackage October 18, 2012
README.md

haskell-Data.Hash.Consistent

Data.Hash.Consistent

A consistent hash is a technique to manage the fair distribution of cacheable entities among hosts. Each host identifier has its crc32 hash calculated and stored in a Vector along with its canonical host name. The host identifier may be differentiated from its canonical host name by a multiplying factor, in our case a simple integer appeneded to the hostname to provide it with a number of entries in the consistent hash, all evenly distributed.

This technique is explained in these links:

http://en.wikipedia.org/wiki/Consistent_hashing

http://www.tomkleinpeter.com/2008/03/17/programmers-toolbox-part-3-consistent-hashing/

Something went wrong with that request. Please try again.