Sciweavers

127 search results - page 2 / 26
» Counter-Based Cache Replacement Algorithms
Sort
View
TKDE
2002
123views more  TKDE 2002»
13 years 4 months ago
Coordinated Placement and Replacement for Large-Scale Distributed Caches
In a large-scale information system such as a digital library or the web, a set of distributed caches can improve their effectiveness by coordinating their data placement decisions...
Madhukar R. Korupolu, Michael Dahlin
ISCA
2010
IEEE
237views Hardware» more  ISCA 2010»
13 years 3 months ago
High performance cache replacement using re-reference interval prediction (RRIP)
Practical cache replacement policies attempt to emulate optimal replacement by predicting the re-reference interval of a cache block. The commonly used LRU replacement policy alwa...
Aamer Jaleel, Kevin B. Theobald, Simon C. Steely J...
MSS
1999
IEEE
203views Hardware» more  MSS 1999»
13 years 9 months ago
Improved Adaptive Replacement Algorithm for Disk-Caches in HSM Systems
With an ever increasing amount of data to store, hierarchical storage management (HSM) systems must still use tape for tertiary storage. A disk cache is used to reduce the access ...
Ulrich Hahn, Werner Dilling, Dietmar Kaletta
ICS
2004
Tsinghua U.
13 years 10 months ago
Inter-reference gap distribution replacement: an improved replacement algorithm for set-associative caches
We propose a novel replacement algorithm, called InterReference Gap Distribution Replacement (IGDR), for setassociative secondary caches of processors. IGDR attaches a weight to e...
Masamichi Takagi, Kei Hiraki
PAM
2011
Springer
12 years 7 months ago
Evolution of Cache Replacement Policies to Track Heavy-Hitter Flows
Several important network applications cannot easily scale to higher data rates without requiring focusing just on the large traffic flows. Recent works have discussed algorithmic...
Martin Zádník, Marco Canini