PLDI
1995
ACM
1995
ACM
Interprocedural Partial Redundancy Elimination and its Application to Distributed Memory Compilation
13 years 8 months ago
Partial Redundancy Elimination PRE is a general scheme for suppressing partial redundancies which encompasses traditional optimizations like loop invariant code motion and redun...
EUROPAR
2003
Springer
13 years 9 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...
PLDI
2003
ACM
13 years 9 months ago
2003
ACM
Speculative execution, such as control speculation and data speculation, is an effective way to improve program performance. Using edge/path profile information or simple heuristi...
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) ...
IEEEPACT
2006
IEEE
13 years 10 months ago
2006
IEEE
Modern compiler transformations that eliminate redundant computations or reorder instructions, such as partial redundancy elimination and instruction scheduling, are very effectiv...