2956 search results - page 72 / 592 » Targeted Data Prefetching |
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...
112
click to vote
IEEEPACT
2002
IEEE
15 years 4 months ago
2002
IEEE
Simultaneous Multithreading (SMT) processors achieve high processor throughput at the expense of single-thread performance. This paper investigates resource allocation policies fo...
JUCS
2000
14 years 11 months ago
2000
: Since the era of vector and pipelined computing, the computational speed is limited by the memory access time. Faster caches and more cache levels are used to bridge the growing ...