Access-time aware cache algorithms - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2016

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.
Fichier principal
Vignette du fichier
HAL_version_nov2016.pdf (1.15 Mo) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01402425 , version 1 (24-11-2016)

Identifiers

  • HAL Id : hal-01402425 , version 1

Cite

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⟩
118 View
111 Download

Share

Gmail Facebook X LinkedIn More