Hashing, Load Balancing and Multiple Choice

by Udi Wieder

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,...

• Format: Paperback
• Language: English
• ISBN: 1680832824
• ISBN13: 9781680832822
• Release Date: July 2017
• Publisher: Now Publishers
• Length: 120 Pages
• Weight: 0.39 lbs.
• Dimensions: 0.3" x 6.1" x 9.2"