Access-time aware cache algorithms
Résumé
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.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...