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.
%0 Conference Paper
%1 Neglia2016
%A Neglia, Giovanni
%A Carra, Damiano
%A Feng, Mingdong
%A Janardhan, Vaishnav
%A Michiardi, Pietro
%A Tsigkari, Dimitra
%B 28th International Teletraffic Congress (ITC 28)
%C Würzburg, Germany
%D 2016
%K itc itc28
%T Access-time Aware Cache Algorithms
%U https://gitlab2.informatik.uni-wuerzburg.de/itc-conference/itc-conference-public/-/raw/master/itc28/Neglia2016.pdf?inline=true
%X 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.
@inproceedings{Neglia2016,
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.},
added-at = {2016-08-31T16:30:53.000+0200},
address = {Würzburg, Germany},
author = {Neglia, Giovanni and Carra, Damiano and Feng, Mingdong and Janardhan, Vaishnav and Michiardi, Pietro and Tsigkari, Dimitra},
biburl = {https://www.bibsonomy.org/bibtex/2c443c9b77452617d43154359b167b432/itc},
booktitle = {28th International Teletraffic Congress (ITC 28)},
days = {12},
interhash = {6cda51bea65035706be5cdfa51a7ebca},
intrahash = {c443c9b77452617d43154359b167b432},
keywords = {itc itc28},
month = {Sept},
timestamp = {2020-05-26T16:53:35.000+0200},
title = {Access-time Aware Cache Algorithms},
url = {https://gitlab2.informatik.uni-wuerzburg.de/itc-conference/itc-conference-public/-/raw/master/itc28/Neglia2016.pdf?inline=true},
year = 2016
}