Cache Miss Estimation for Non-Stationary Request Processes

Abstract : The goal of the paper is to evaluate the miss probability of a Least Recently Used (LRU) cache, when it is offered a non-stationary request process given by a Poisson cluster point process. First, we construct a probability space using Palm theory, describing how to consider a tagged document with respect to the rest of the request process. This framework allows us to derive a fundamental integral formula for the expected number of misses of the tagged document. Then, we consider the limit when the cache size and the arrival rate go to infinity in proportion, and use the integral formula to derive an asymptotic expansion of the miss probability in powers of the inverse of the cache size. This enables us to quantify and improve the accuracy of the so-called Che approximation.
Type de document :
Pré-publication, Document de travail
2015
Liste complète des métadonnées

Littérature citée [23 références]  Voir  Masquer  Télécharger

https://hal-polytechnique.archives-ouvertes.fr/hal-01232173
Contributeur : Carl Graham <>
Soumis le : mardi 28 novembre 2017 - 09:29:18
Dernière modification le : jeudi 10 mai 2018 - 02:04:37

Fichiers

cache_miss.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Citation

Felipe Olmos, Carl Graham, Alain Simonian. Cache Miss Estimation for Non-Stationary Request Processes. 2015. 〈hal-01232173v2〉

Partager

Métriques

Consultations de la notice

69

Téléchargements de fichiers

40