3202 search results - page 133 / 641 » Memory access scheduling |
152
click to vote
HPCA
1997
IEEE
15 years 8 months ago
1997
IEEE
Many parallel systems offer a simple view of memory: all storage cells are addresseduniformly. Despite a uniform view of the memory, the machines differsignificantly in theirmemo...
124
click to vote
LCPC
2005
Springer
15 years 10 months ago
2005
Springer
Programming network processors remains a challenging task since their birth until recently when high-level programming environments for them are emerging. By employing domain speci...
148
click to vote
ISCA
2005
IEEE
15 years 10 months ago
2005
IEEE
Coherent read misses in shared-memory multiprocessors account for a substantial fraction of execution time in many important scientific and commercial workloads. We propose Tempor...
132
Voted
KDD
1998
ACM
15 years 8 months ago
1998
ACM
Many data mining tasks (e.g., Association Rules, Sequential Patterns) use complex pointer-based data structures (e.g., hash trees) that typically suffer from sub-optimal data loca...
142
Voted
LATIN
2010
Springer
15 years 6 months ago
2010
Springer
In this paper we describe algorithms for computing the BWT and for building (compressed) indexes in external memory. The innovative feature of our algorithms is that they are light...