Balanced Allocations (Lecture Notes)

Abstract

We investigate balls-and-bins processes related to load balancing, resource allocation, and hashing. Suppose n balls should be placed one after the other into n bins in such a way that the allocation is as even as possible. In particular, we aim at minimizing the maximum load, i.e., the maximum number of balls that are placed into the same bin. Clearly, if… (More)

Topics

1 Figure or Table

Slides referencing similar topics