456 search results - page 42 / 92 » Compiler Optimizations for Improving Data Locality |
77
Voted
SODA
2008
ACM
14 years 11 months ago
2008
ACM
Local ratio is a well-known paradigm for designing approximation algorithms for combinatorial optimization problems. At a very high level, a local-ratio algorithm first decomposes ...
VALUETOOLS
2006
ACM
15 years 3 months ago
2006
ACM
Cache locality optimization is an efficient way for reducing the idle time of modern processors in waiting for needed data. This kind of optimization can be achieved either on the...
CJ
1999
14 years 9 months ago
1999
We present a compiler optimization approach that uses the simulated evolution (SE) paradigm to enhance the finish time of heuristically scheduled computations with communication t...
160
Voted
SIGMOD
2007
ACM
15 years 9 months ago
2007
ACM
Content-based dissemination of XML data using the publishsubscribe paradigm is an effective means to deliver relevant data to interested data consumers. To meet the performance ch...
78
Voted
ACMMSP
2004
ACM
15 years 3 months ago
2004
ACM
Instruction combining is an optimization to replace a sequence of instructions with a more efficient instruction yielding the same result in a fewer machine cycles. When we use it...