45 search results - page 4 / 9 » Optimal and Efficient Speculation-Based Partial Redundancy E... |
VLSID
2004
IEEE
15 years 10 months ago
2004
IEEE
It has been observed that even highly optimized software programs perform "redundant" computations during their execution, due to the nature (statistics) of the values a...
CGO
2003
IEEE
15 years 3 months ago
2003
IEEE
In this paper we present the internal representation and optimizations used by the CASH compiler for improving the memory parallelism of pointer-based programs. CASH uses an SSA-b...
DCC
2005
IEEE
15 years 9 months ago
2005
IEEE
We analyze the technique for reducing the complexity of entropy coding consisting in the a priori grouping of the source alphabet symbols, and in dividing the coding process in tw...
ASPLOS
2008
ACM
14 years 11 months ago
2008
ACM
Many code analysis techniques for optimization, debugging, or parallelization need to perform runtime disambiguation of sets of addresses. Such operations can be supported efficie...
167
click to vote
ICFP
2009
ACM
15 years 10 months ago
2009
ACM
Memoization is a well-known optimization technique used to eliminate redundant calls for pure functions. If a call to a function f with argument v yields result r, a subsequent ca...