Hashing, Load Balancing, and Multiple Choice

Udi Wieder worked for VMware Research as a senior staff researcher. He is mostly interested in statistical data analysis algorithms. In recent years, he has concentrated on anomaly detection and classification fairness. Data Structures, Randomized Algorithms, Scheduling, and Load Balancing are always on his mind.

Hashing, Load Balancing, and Multiple Choice introduce some of the fundamental algorithmic concepts that support many of the practical and theoretically interesting solutions to this problem. It focuses on multiple-choice systems in which objects are placed into buckets using several distinct hash functions, with the least loaded bucket being selected at the moment of placement. It examines the resulting distributions and demonstrates how these concepts could be applied to the creation of basic data structures. It concentrates on dictionaries in terms of data structures, including linear probing, cuckoo hashing, and many of their variants.

Some reviews about this book: 'Load Balancing' is a generic name given to a variety of algorithmic problems where a set of items need to be partitioned across buckets so that a load of each bucket is approximately evenly distributed. This book presents some of the basic algorithmic ideas that underpin many of the interesting approaches to this problem.

Author: Udi Wieder

Link to buy: https://www.amazon.com/-/es/Udi-Wieder/dp/1680832824/ref=sr_1_1?