456 search results - page 66 / 92 » Compiler Optimizations for Improving Data Locality |
CCS
2010
ACM
14 years 10 months ago
2010
ACM
Secure two-party computation allows two untrusting parties to jointly compute an arbitrary function on their respective private inputs while revealing no information beyond the ou...
VLDB
1998
ACM
15 years 1 months ago
1998
ACM
The problem of finding an optimal bipartition of a rectangle set has a direct impact on query performance of dynamic R-trees. During update operations, overflowed nodes need to be...
101
click to vote
ISPASS
2008
IEEE
15 years 4 months ago
2008
IEEE
—The potential for improving the performance of data-intensive scientific programs by enhancing data reuse in cache is substantial because CPUs are significantly faster than me...
CLUSTER
2004
IEEE
15 years 1 months ago
2004
IEEE
Improving memory performance at software level is more effective in reducing the rapidly expanding gap between processor and memory performance. Loop transformations (e.g. loop un...
PLDI
2005
ACM
15 years 3 months ago
2005
ACM
A critical optimization in the domain of linear signal transforms, such as the discrete Fourier transform (DFT), is loop merging, which increases data locality and reuse and thus ...