720 search results - page 22 / 144 » Uniform Memory Hierarchies |
124
click to vote
FOCS
2003
IEEE
15 years 9 months ago
2003
IEEE
This paper gives tight bounds on the cost of cache-oblivious searching. The paper shows that no cache-oblivious search structure can guarantee a search performance of fewer than l...
164
click to vote
IJFCS
2002
15 years 3 months ago
2002
We propose a new data structure to compute the Delaunay triangulation of a set of points in the plane. It combines good worst case complexity, fast behavior on real data, small me...
135
click to vote
PLDI
1997
ACM
15 years 8 months ago
1997
ACM
We present a simple and novel framework for generating blocked codes for high-performance machines with a memory hierarchy. Unlike traditional compiler techniques like tiling, whi...
154
click to vote
DAMON
2008
Springer
15 years 6 months ago
2008
Springer
A major performance bottleneck for database systems is the memory hierarchy. The performance of the memory hierarchy is directly related to how the content of disk pages maps to t...
152
click to vote
EUROPAR
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. As heterogeneous computing platforms become more prevalent, the programmer must account for complex memory hierarchies in addition to the difficulties of parallel program...