27 search results - page 2 / 6 » Partial Redundancy Elimination for Access Path Expressions |
140
click to vote
MICRO
2000
IEEE
14 years 9 months ago
2000
IEEE
level of abstraction, compared with the program representation for scalar optimizations. For example, loop unrolling and loop unrolland-jam transformations exploit the large regist...
PEPM
1998
ACM
15 years 1 months ago
1998
ACM
Abstract. We use a code generator--type-directed partial evaluation-to verify conversions between isomorphic types, or more precisely to verify that a composite function is the ide...
POS
1998
Springer
15 years 1 months ago
1998
Springer
Persistent programming languages manage volatile memory as a cache for stable storage, imposing a read barrier on operations that access the cache, and a write barrier on updates ...
CGO
2003
IEEE
15 years 2 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...
PLDI
1999
ACM
15 years 1 months ago
1999
ACM
Load-reuse analysis finds instructions that repeatedly access the same memory location. This location can be promoted to a register, eliminating redundant loads by reusing the re...