Sciweavers

88 search results - page 5 / 18
» Outperforming LRU with an Adaptive Replacement Cache Algorit...
Sort
View
ICCD
2005
IEEE
165views Hardware» more  ICCD 2005»
15 years 7 months ago
Counter-Based Cache Replacement 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
ISCA
2000
IEEE
107views Hardware» more  ISCA 2000»
15 years 3 months ago
A fully associative software-managed cache design
As DRAM access latencies approach a thousand instructionexecution times and on-chip caches grow to multiple megabytes, it is not clear that conventional cache structures continue ...
Erik G. Hallnor, Steven K. Reinhardt
BIOADIT
2004
Springer
15 years 4 months ago
Media Streaming on P2P Networks with Bio-inspired Cache Replacement Algorithm
With the growth of computing power and the proliferation of broadband access to the Internet, the use of media streaming has become widely diffused. By using the P2P communication...
Masahiro Sasabe, Naoki Wakamiya, Masayuki Murata, ...
ICS
2004
Tsinghua U.
15 years 4 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
WAIM
2004
Springer
15 years 4 months ago
Performance Evaluations of Replacement Algorithms in Hierarchical Web Caching
Abstract. Web caching plays an important role in many network services. Utilization of the cache in each level (server, proxy, and client) of network forms a web caching hierarchy....
Haohuan Fu, Pui-on Au, Weijia Jia