27 search results - page 1 / 6 » Partial Redundancy Elimination for Access Path Expressions |
ECOOPW
1999
Springer
13 years 9 months ago
1999
Springer
CGO
2003
IEEE
13 years 8 months ago
2003
IEEE
Existing profile-guided partial redundancy elimination (PRE) methods use speculation to enable the removal of partial redundancies along more frequently executed paths at the expe...
CC
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Partial redundancy elimination (PRE) is a program transformation that identifies and eliminates expressions that are redundant on at least one (but not necessarily all) ...
EUROPAR
2003
Springer
13 years 10 months ago
2003
Springer
Partial redundancy elimination (PRE) techniques play an important role in optimizing compilers. Many optimizations, such as elimination of redundant expressions, communication opti...
IMC
2010
ACM
13 years 2 months ago
2010
ACM
Network-level redundancy elimination (RE) algorithms reduce traffic volume on bandwidth-constrained network paths by avoiding the transmission of repeated byte sequences. Previous...