Access-Time-Aware Cache Algorithms - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles ACM Transactions on Modeling and Performance Evaluation of Computing Systems Year : 2017

Access-Time-Aware Cache Algorithms

Giovanni Neglia
Damiano Carra
  • Function : Author
  • PersonId : 865031
Mingdong Feng
  • Function : Author
  • PersonId : 980176
Pietro Michiardi
  • Function : Author
  • PersonId : 1084771


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 performance. 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. Moreover, we show that our policy can be considered in a more general context, since it can be easily adapted to minimize any retrieval cost, as far as costs add over cache misses.
Fichier principal
Vignette du fichier
00_access_time_aware_caching (1).pdf (1.23 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01956285 , version 1 (15-12-2018)



Giovanni Neglia, Damiano Carra, Mingdong Feng, Vaishnav Janardhan, Pietro Michiardi, et al.. Access-Time-Aware Cache Algorithms. ACM Transactions on Modeling and Performance Evaluation of Computing Systems, 2017, 2 (4), pp.1-29. ⟨10.1145/3149001⟩. ⟨hal-01956285⟩
89 View
230 Download



Gmail Facebook X LinkedIn More