Sciweavers

89 search results - page 3 / 18
» Performance Evaluations of Replacement Algorithms in Hierarc...
Sort
View
TC
2008
13 years 7 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
ICS
2004
Tsinghua U.
14 years 28 days 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
SAC
2004
ACM
14 years 1 months ago
Caching in Web memory hierarchies
Web cache replacement algorithms have received a lot of attention during the past years. Though none of the proposed algorithms deals efficiently with all the particularities of t...
Dimitrios Katsaros, Yannis Manolopoulos
ICPADS
1998
IEEE
13 years 11 months ago
Probability Based Replacement Algorithm for WWW Server Arrays
This paper describes a scalable Web server array architecture which uses a caching policy called Probability Based Replacement (PBR) algorithm [5, 6]. The server array consists of...
K. H. Yeung, K. W. Suen
MASCOTS
2001
13 years 9 months ago
Simulation Evaluation of a Heterogeneous Web Proxy Caching Hierarchy
This paper uses trace-driven simulations to evaluate the performance of different cache management techniques for multi-level Web proxy caching hierarchies. In particular, the exp...
Mudashiru Busari, Carey L. Williamson