Skip to Main content Skip to Navigation
Reports

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.
Complete list of metadatas

Cited literature [14 references]  Display  Hide  Download

https://hal.inria.fr/hal-01292834
Contributor : Giovanni Neglia <>
Submitted on : Wednesday, March 23, 2016 - 6:48:39 PM
Last modification on : Saturday, January 27, 2018 - 1:31:42 AM
Document(s) archivé(s) le : Monday, November 14, 2016 - 3:10:15 AM

File

RR-8886.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01292834, version 1

Collections

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⟩

Share

Metrics

Record views

1847

Files downloads

592