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 :
Communication dans un congrès
International Teletraffic Congress ITC-28, Sep 2016, Würzburg, Germany. Proc. of ITC-28
Liste complète des métadonnées

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

https://hal.inria.fr/hal-01402425
Contributeur : Dimitra Tsigkari <>
Soumis le : jeudi 24 novembre 2016 - 16:14:50
Dernière modification le : samedi 27 janvier 2018 - 01:31:41
Document(s) archivé(s) le : mardi 21 mars 2017 - 05:15:44

Fichier

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

Identifiants

  • HAL Id : hal-01402425, version 1

Collections

Citation

Giovanni Neglia, Damiano Carra, Mingdong Feng, Vaishnav Janardhan, Pietro Michiardi, et al.. Access-time aware cache algorithms. International Teletraffic Congress ITC-28, Sep 2016, Würzburg, Germany. Proc. of ITC-28. 〈hal-01402425〉

Partager

Métriques

Consultations de la notice

214

Téléchargements de fichiers

59