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:
“Yet poetry, though the last and finest result, is a natural fruit. As naturally as the oak bears an acorn, and the vine a gourd, man bears a poem, either spoken or done. It is the chief and most memorable success, for history is but a prose narrative of poetic deeds.”
—Henry David Thoreau (1817–1862)
“Every member of the family of the future will be a producer of some kind and in some degree. The only one who will have the right of exemption will be the mother ...”
—Ruth C. D. Havens, U.S. suffragist. As quoted in History of Woman Suffrage, vol. 4, ch. 13, by Susan B. Anthony and Ida Husted Harper (1902)
“If you look at the 150 years of modern China’s history since the Opium Wars, then you can’t avoid the conclusion that the last 15 years are the best 15 years in China’s modern history.”
—J. Stapleton Roy (b. 1935)