BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//University of Liverpool Computer Science Seminar System//v2//EN
BEGIN:VEVENT
DTSTAMP:20260922T022122Z
UID:Seminar-dept-330@lxserverM.csc.liv.ac.uk
ORGANIZER:CN=Lutz Oettershagen:MAILTO:Lutz.Oettershagen@liverpool.ac.uk
DTSTART:20131008T160000
DTEND:20131008T170000
SUMMARY:School Seminar Series
DESCRIPTION:Dr. Thomas Sauerwald: Balls into bins via local search\n\nWe study a natural process for allocating m balls (tasks) into n bins (resources) that are organized as the vertices of an undirected graph G. Balls arrive one at a time. When a ball arrives, it first chooses a vertex u in G uniformly at random. Then the ball performs a local search in G starting from u until it reaches a vertex with local minimum load, where the ball is finally placed on.Then the next ball arrives and this procedure is repeated. In this talk we derive bounds on the maximum load of this process and the time until every bin has at least one ball allocated to it.\n\nhttps://www.csc.liv.ac.uk/research/seminars/abstract.php?id=330
LOCATION:Ashton Lecture Theater
END:VEVENT
END:VCALENDAR