Sciweavers

24 search results - page 1 / 5
» Inter-reference gap distribution replacement: an improved re...
Sort
View
ICS
2004
Tsinghua U.
13 years 9 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
MSS
1999
IEEE
203views Hardware» more  MSS 1999»
13 years 8 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
TC
2008
13 years 3 months ago
Counter-Based Cache Replacement and Bypassing Algorithms
Recent studies have shown that, in highly associative caches, the performance gap between the Least Recently Used (LRU) and the theoretical optimal replacement algorithms is large,...
Mazen Kharbutli, Yan Solihin
TKDE
2002
123views more  TKDE 2002»
13 years 3 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
IPPS
2010
IEEE
13 years 1 months ago
Adapting cache partitioning algorithms to pseudo-LRU replacement policies
Abstract-- Recent studies have shown that cache partitioning is an efficient technique to improve throughput, fairness and Quality of Service (QoS) in CMP processors. The cache par...
Kamil Kedzierski, Miquel Moretó, Francisco ...