16 search results - page 1 / 4 » Efficient Tree Layout in a Multilevel Memory Hierarchy |
170
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
Consider laying out a fixed-topology tree of N nodes into external memory with block size B so as to minimize the worst-case number of block memory transfers required to traverse ...
192
click to vote
CGF
2006
15 years 7 months ago
2006
We present a novel algorithm to compute cache-efficient layouts of bounding volume hierarchies (BVHs) of polygonal models. Our approach does not make any assumptions about the cac...
173
Voted
TVCG
2010
15 years 1 months ago
2010
Abstract--One important bottleneck when visualizing large data sets is the data transfer between processor and memory. Cacheaware (CA) and cache-oblivious (CO) algorithms take into...
161
Voted
MICRO
1997
IEEE
15 years 11 months ago
1997
IEEE
High performance architectures depend heavily on efficient multi-level memory hierarchies to minimize the cost of accessing data. This dependence will increase with the expected i...