Max-Planck-Institut für Informatik
max planck institut
mpii logo Minerva of the Max Planck Society

MPI-INF or MPI-SWS or Local Campus Event Calendar

<< Previous Entry Next Entry >> New Event Entry Edit this Entry Login to DB (to update, delete)
What and Who
Title:Smoothed Analysis of Online Caching
Speaker:Rüdiger Reischuk
coming from:Uni Luebeck
Speakers Bio:
Event Type:Lecture
Visibility:D1, D2, D3, D4, D5, RG1, SWS, MMCI
We use this to send out email in the morning.
Level:AG Audience
Date, Time and Location
Date:Tuesday, 12 March 2013
Duration:45 Minutes
Building:E1 4

Solving an optimization problem \emph{online} means serving a sequence of requests
one after the other without knowing future requests.
The performance of an online algorithm is measured by the \emph{competitive ratio},
the quotient of its solution and an optimal solution computed off\-line.
This ratio can be quite high in the worst case.
The problem to minimize cache misses for a sequence of data requests is a
typical example, where a simple adversary can force a ratio up to to the cache size.
However, the performance of caching algorithms like LRU seems to be much better
in real life.

We have made an approach to explain this phenomenon by a smoothed analysis
and present some results.
We will also discuss how to measure performance ratios in a probabilistic setting.

Name(s):Kurt Mehlhorn
Video Broadcast
Video Broadcast:NoTo Location:
Tags, Category, Keywords and additional notes
Attachments, File(s):

Created:Kurt Mehlhorn/AG1/MPII/DE, 03/05/2013 07:45 PM Last modified:Uwe Brahm/MPII/DE, 11/24/2016 04:13 PM
  • Kurt Mehlhorn, 03/05/2013 07:45 PM -- Created document.