BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Balls into Bins: A Sequential Resource Allocation Problem - Ryan L
 au\, Churchill College
DTSTART:20151014T180000Z
DTEND:20151014T184000Z
UID:TALK61829@talks.cam.ac.uk
CONTACT:Matthew Ireland
DESCRIPTION:Sequential resource allocation problems arise naturally in com
 puter science. For example\, load balancing can be viewed as an instance o
 f such problem. Therefore\, there is general interest from the community i
 n methods for distributing resources evenly\, robustly and efficiently. Th
 is presentation introduces the balls into bins model as an abstract charac
 terization of such problems. Different allocation strategies will be discu
 ssed and contrasted\, with an emphasis on randomized allocations such as t
 he one-choice and the d­choice processes. We shall show that the latter\,
  being a simple generalization of the former\, does possess the three prop
 erties we seek for allocation algorithms. Perhaps surprisingly\, these the
 oretical results can be applied to drastically optimise the performance of
  hash tables.\n
LOCATION:Wolfson Hall\, Churchill College
END:VEVENT
END:VCALENDAR