Skip to Main content Skip to Navigation
New interface
Conference papers

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 metadata

Cited literature [17 references]  Display  Hide  Download
Contributor : Dimitra Tsigkari Connect in order to contact the contributor
Submitted on : Thursday, November 24, 2016 - 4:14:50 PM
Last modification on : Friday, November 18, 2022 - 9:24:44 AM
Long-term archiving on: : Tuesday, March 21, 2017 - 5:15:44 AM


Files produced by the author(s)


  • HAL Id : hal-01402425, version 1



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⟩



Record views


Files downloads