12 search results - page 1 / 3 » The set-associative cache performance of search trees |
HIPEAC
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. In this paper, we propose a novel approach to reduce dynamic power in set-associative caches that leverages on a leakage-saving proposal, namely Cache Decay. We thus open...
SODA
2003
ACM
13 years 5 months ago
2003
ACM
We consider the costs of access to data stored in search trees assuming that those memory accesses are managed with a cache. Our cache memory model is two-level, has a small degre...
HPCA
1996
IEEE
13 years 8 months ago
1996
IEEE
In this paper, we propose a cache design that provides the same miss rate as a two-way set associative cache, but with a access time closer to a direct-mapped cache. As with other...
SIGMETRICS
2003
ACM
13 years 9 months ago
2003
ACM
In main-memory databases, the number of processor cache misses has a critical impact on the performance of the system. Cacheconscious indices are designed to improve performance b...
SIGMOD
2001
ACM
14 years 4 months ago
2001
ACM
This paper proposes and evaluates Prefetching B+ -Trees pB+ -Trees, which use prefetching to accelerate two important operations on B+ -Tree indices: searches and range scans. To ...