University of Cambridge > > Churchill CompSci Talks > Balanced Allocations : Balls into Bins

Balanced Allocations : Balls into Bins

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Matthew Ireland.

No one loves it when all your teammates are slacking and you are doing all the work, so do your CPU and the servers! That is why we all need balanced allocations, a way to distribute tasks among agents to minimize the maximum load on each agent. In this talk, we will explore the famous balls-into-bins model and how different allocation strategies, namely purely random allocation, power of two and graphical allocation performs under this model. These allocation strategies also have extensive uses in the real world, such as resource allocation and hashing.

This talk is part of the Churchill CompSci Talks series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2024, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity