449 search results - page 24 / 90 » Optimizing the use of GPU memory in applications with large ... |
PDPTA
2000
13 years 10 months ago
2000
Exploiting compile time knowledge to improve memory bandwidth can produce noticeable improvements at run-time [13, 1]. Allocating the data structure [13] to separate memories when...
VLDB
2004
ACM
14 years 1 months ago
2004
ACM
Large boolean matrices are a basic representational unit in a variety of applications, with some notable examples being interactive visualization systems, mining large graph struc...
CMPB
2010
13 years 8 months ago
2010
A large number of algorithms have been developed to perform non-rigid registration and it is a tool commonly used in medical image analysis. The FreeForm Deformation algorithm is ...
SC
2003
ACM
14 years 1 months ago
2003
ACM
We investigate runtime strategies for data-intensive applications that involve generalized reductions on large, distributed datasets. Our set of strategies includes replicated fi...
IEEEPACT
2006
IEEE
14 years 2 months ago
2006
IEEE
On machines with high-performance processors, the memory system continues to be a performance bottleneck. Compilers insert prefetch operations and reorder data accesses to improve...