Graduate School and Research Center in Digital Sciences

Access-time aware cache algorithms

Neglia, Giovanni; Carra, Damiano; Feng, Mingdong; Janardhan, Vaishnav; Michiardi, Pietro; Tsigkari, Dimitra

ITC 2016, 28th International Teletraffic Congress, September 12-16, 2016, Würzburg, Germany

Best Paper Award

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.

Document Doi Hal Bibtex

Title:Access-time aware cache algorithms
Keywords:Cache, Cache replacement policy, Caching architecture, Content Delivery Network (CDN), Hard disk access time, Knapsack problem
Department:Data Science
Eurecom ref:4860
Copyright: © 2016 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Bibtex: @inproceedings{EURECOM+4860, doi = {}, year = {2016}, title = {{A}ccess-time aware cache algorithms}, author = {{N}eglia, {G}iovanni and {C}arra, {D}amiano and {F}eng, {M}ingdong and {J}anardhan, {V}aishnav and {M}ichiardi, {P}ietro and {T}sigkari, {D}imitra}, booktitle = {{ITC} 2016, 28th {I}nternational {T}eletraffic {C}ongress, {S}eptember 12-16, 2016, {W}{\"u}rzburg, {G}ermany}, address = {{W}{\"u}rzburg, {GERMANY}}, month = {09}, url = {} }
See also: