88 search results - page 3 / 18 » Outperforming LRU with an Adaptive Replacement Cache Algorit... |
EDBT
2002
ACM
15 years 11 months ago
2002
ACM
For a spatial database management system, it is an important goal to minimize the I/O-cost of queries and other operations. Several page-replacement strategies have been proposed a...
ACMSE
2004
ACM
15 years 4 months ago
2004
ACM
Replacement policy, one of the key factors determining the effectiveness of a cache, becomes even more important with latest technological trends toward highly associative caches....
MICRO
2006
IEEE
15 years 4 months ago
2006
IEEE
We present and evaluate the idea of adaptive processor cache management. Specifically, we describe a novel and general scheme by which we can combine any two cache management alg...
107
click to vote
IEEEPACT
2002
IEEE
15 years 3 months ago
2002
IEEE
Memory performance is increasingly determining microprocessor performance and technology trends are exacerbating this problem. Most architectures use set-associative caches with L...
TC
2008
14 years 10 months ago
2008
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,...