@Misc{berg:replacement-2004,
  author =	{Christoph Berg},
  title =	{Analyzing caches: Replacement strategies and persistence},
  booktitle =	{},
  year =	2004,
  month =	jul,
  day =		8,
  note =	{Ringvorlesung Graduiertenkolleg „Leistungsgarantien für Rechnersysteme“},
  bibtex =	{2004/replacement.bib},
  slides =	{2004/replacement.pdf},
  abstract =	{The abstract interpretation framework used to analyze worst case cache
  behavior for real-time system works well for caches with
  least-recently-used (LRU) replacement. We give insights into why LRU
  is amenable to analysis and contrast this with a cache using FIFO
  (first-in, first-out) replacement, where no tight and at the same time
  safe upper bound on cache misses can be given.

  The current approach evaluates each memory access in a program to
  decide its cache behavior. Another approach to cache analysis is to
  bound the total number of misses that can occur in parts of a given
  program. We outline research issues that will hopefully lead to better
  bounds on cache behavior in the future.},
}