Access-time aware cache algorithms

Abstract : Most of the caching algorithms are oblivious to requests' timescale, but caching systems are capacity constrained and, in practical cases, the hit rate may be limited by the cache's impossibility to serve requests fast enough. In particular the hard-disk access time can be the key factor capping cache performances. In this paper, we present a new cache replacement policy that takes advantage of a hierarchical caching architecture, and in particular of access-time difference between memory and disk. Our policy is optimal when requests follow the independent reference model, and significantly reduces the hard-disk load, as shown also by our realistic, trace-driven evaluation.
Type de document :
Rapport
[Research Report] RR-8886, Inria Sophia Antipolis. 2016
Liste complète des métadonnées

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

https://hal.inria.fr/hal-01292834
Contributeur : Giovanni Neglia <>
Soumis le : mercredi 23 mars 2016 - 18:48:39
Dernière modification le : jeudi 11 janvier 2018 - 16:58:00
Document(s) archivé(s) le : lundi 14 novembre 2016 - 03:10:15

Fichier

RR-8886.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-01292834, version 1

Citation

Giovanni Neglia, Damiano Carra, Mingdong Feng, Vaishnav Janardhan, Pietro Michiardi, et al.. Access-time aware cache algorithms. [Research Report] RR-8886, Inria Sophia Antipolis. 2016. 〈hal-01292834〉

Partager

Métriques

Consultations de la notice

364

Téléchargements de fichiers

270