4278 search results - page 49 / 856 » Data prefetch mechanisms |
CASES
2001
ACM
15 years 3 months ago
2001
ACM
With the widening performance gap between processors and main memory, efficient memory accessing behavior is necessary for good program performance. Loop partition is an effective...
167
click to vote
ICDE
2004
IEEE
16 years 1 months ago
2004
IEEE
Scientific visualization applications are very dataintensive, with high demands for I/O and data management. Developers of many visualization tools hesitate to use traditional DBM...
102
click to vote
DAWAK
2001
Springer
15 years 4 months ago
2001
Springer
Tree based indexing structures like -trees, ·-trees, Bitmap indexes and Ê-trees have become essential for getting good performance when accessing vast datasets. However, most dat...
102
click to vote
ISCA
2000
IEEE
15 years 4 months ago
2000
IEEE
Trace caches enable high bandwidth, low latency instruction supply, but have a high miss penalty and relatively large working sets. Consequently, their performance may suffer due ...
100
click to vote
LCTRTS
2009
Springer
15 years 6 months ago
2009
Springer
Instruction fetch behavior has been shown to be very regular and predictable, even for diverse application areas. In this work, we propose the Lookahead Instruction Fetch Engine (...