Computers & Internet Books:

Hashing, Load Balancing and Multiple Choice

Customer rating

Click to share your rating 0 ratings (0.0/5.0 average) Thanks for your vote!

Share this product

Hashing, Load Balancing and Multiple Choice by Udi Wieder
In stock with supplier

The item is brand new and in-stock in with one of our preferred suppliers. The item will ship from the Mighty Ape warehouse within the timeframe shown below.

Usually ships within 10-14 days


Delivering to:

Estimated arrival:

  • Around 15-22 November using standard courier delivery


Many tasks in computer systems could be abstracted as distributing items into buckets, so that the allocation of items across buckets is as balanced as possible, and, furthermore, given an item's identifier it is possible to determine quickly to which bucket it was assigned. A canonical example is a dictionary data structure, where `items' stands for key-value pairs and `buckets' for memory locations. Another example is a distributed key-value store, where the buckets represent locations in disk or even whole servers. A third example may be a distributed execution engine where items represent processes and buckets compute devices, and so on. A common technique in this domain is the use of a hash-function that maps an item into a relatively short fixed length string. The hash function is then used in some way to associate the item to its bucket. The use of a hash function is typically the first step in the solution and additional algorithmic ideas are required to deal with collisions and the imbalance of hash values. Hashing, Load Balancing and Multiple Choice presents some of the basic algorithmic ideas that underpin many of the practical and theoretically interesting approaches for this problem. It focuses on multiple choice schemes where items are placed into buckets via the use of several independent hash functions, and typically an item is placed at the least loaded bucket at the time of placement. It analyses the distributions obtained, and shows how these ideas could be used to design basic data structures. With respect to data structures it focuses on dictionaries, presenting linear probing, cuckoo hashing and many of their variants.
Release date NZ
July 11th, 2017
Country of Publication
United States
now publishers Inc
Product ID

Customer reviews

Nobody has reviewed this product yet. You could be the first!

Write a Review

Marketplace listings

There are no Marketplace listings available for this product currently.
Already own it? Create a free listing and pay just 9% commission when it sells!

Sell Yours Here

Help & options

  • If you think we've made a mistake or omitted details, please send us your feedback. Send Feedback
  • If you have a question or problem with this product, visit our Help section. Get Help
  • Seen a lower price for this product elsewhere? We'll do our best to beat it. Request a better price
Filed under...

Buy this and earn 1,328 Banana Points