Analysis of LRU cache trees with a power law reference distribution

Udo R. Krieger, Natalia M. Markovich

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We investigate the performance of a LRU cache replacement policy. Regarding the hit and miss ratios of Zipf-distributed frequencies of object requests in a cascade of LRU caches, new explicit, computationally tractable formulae are derived.

Original languageEnglish
Title of host publicationInformation Technologies and Mathematical Modelling
Subtitle of host publicationQueueing Theory and Applications - 15th International Scientific Conference, ITMM 2016, Proceedings
EditorsRafael Yakupov, Alexander Gortsev, Anatoly Nazarov, Alexander Dudin
PublisherSpringer Verlag
Pages162-167
Number of pages6
ISBN (Print)9783319446141
DOIs
StatePublished - 1 Jan 2016
Externally publishedYes
Event15th International Scientific Conference on Information Technologies and Mathematical Modelling, ITMM 2016 - Katun, Russian Federation
Duration: 12 Sep 201616 Sep 2016

Publication series

NameCommunications in Computer and Information Science
Volume638
ISSN (Print)1865-0929

Conference

Conference15th International Scientific Conference on Information Technologies and Mathematical Modelling, ITMM 2016
Country/TerritoryRussian Federation
CityKatun
Period12/09/1616/09/16

Keywords

  • Cache trees
  • Che’s approximation
  • LRU cache performance

ASJC Scopus subject areas

  • General Computer Science
  • General Mathematics

Fingerprint

Dive into the research topics of 'Analysis of LRU cache trees with a power law reference distribution'. Together they form a unique fingerprint.

Cite this