Jump to content

Stable hashing

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Dgpop (talk | contribs) at 21:48, 3 September 2016 (→‎top). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

This article has multiple issues. Please help improve it or discuss these issues on the talk page. (Learn how and when to remove these template messages)

This article provides insufficient context for those unfamiliar with the subject. Please help improve the article by providing more context for the reader. (September 2016) (Learn how and when to remove this message)

This article does not cite any sources. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed.
Find sources: "Stable hashing" – news · newspapers · books · scholar · JSTOR (December 2009) (Learn how and when to remove this message)

(Learn how and when to remove this message)

Stable hashing is a tool used to implement randomized load balancing and distributed lookup in peer-to-peer computer systems.

See also

This algorithms or data structures-related article is a stub. You can help Wikipedia by expanding it.

This computer networking article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Stable_hashing&oldid=737598549"

Hidden categories: