Consistent Hashing - History

History

Originally devised by Karger et al. at MIT for use in distributed caching, the idea has now been expanded to other areas also. An academic paper from 1997 introduced the term "consistent hashing" as a way of distributing requests among a changing population of Web servers. Each slot is then represented by a node in a distributed system. The addition (joins) and removal (leaves/failures) of nodes only requires items to be re-shuffled when the number of slots/nodes change.

Consistent hashing has also been used to reduce the impact of partial system failures in large Web applications as to allow for robust caches without incurring the system wide fallout of a failure.

The consistent hashing concept also applies to the design of distributed hash tables (DHTs). DHTs use consistent hashing to partition a keyspace among a distributed set of nodes, and additionally provide an overlay network that connects nodes such that the node responsible for any key can be efficiently located.

Read more about this topic:  Consistent Hashing

Famous quotes containing the word history:

    My good friends, this is the second time in our history that there has come back from Germany to Downing Street peace with honour. I believe it is peace for our time. We thank you from the bottom of our hearts. And now I recommend you to go home and sleep quietly in your beds.
    Neville Chamberlain (1869–1940)

    America is the only nation in history which, miraculously, has gone directly from barbarism to degeneration without the usual interval of civilization.
    Attributed to Georges Clemenceau (1841–1929)

    Man watches his history on the screen with apathy and an occasional passing flicker of horror or indignation.
    Conor Cruise O’Brien (b. 1917)