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 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.
Document type :
Journal articles
Complete list of metadatas

Cited literature [34 references]  Display  Hide  Download

https://hal.inria.fr/hal-01956285
Contributor : Giovanni Neglia <>
Submitted on : Saturday, December 15, 2018 - 12:43:15 PM
Last modification on : Monday, December 17, 2018 - 11:25:32 AM
Long-term archiving on : Saturday, March 16, 2019 - 1:26:53 PM

File

00_access_time_aware_caching (...
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01956285, version 1

Collections

Citation

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, ACM, 2017, 2 (4), pp.1-29. ⟨hal-01956285⟩

Share

Metrics

Record views

74

Files downloads

174