Skip to Main content Skip to Navigation

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 [17 references]  Display  Hide  Download

https://hal.inria.fr/hal-01402425
Contributor : Dimitra Tsigkari <>
Submitted on : Thursday, November 24, 2016 - 4:14:50 PM
Last modification on : Saturday, January 27, 2018 - 1:31:41 AM
Document(s) archivé(s) le : Tuesday, March 21, 2017 - 5:15:44 AM

File

HAL_version_nov2016.pdf
Files produced by the author(s)

Identifiers

  • 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. ⟨hal-01402425⟩

Share

Metrics

Record views

284

Files downloads

183