FAQ

Partial redundancy elimination

In compiler theory, partial redundancy elimination (PRE) is a compiler optimization that eliminates expressions that are redundant on some but not… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1990-2017
051019902017

Related topics

Related topics

11 relations
Bernhard SteffenCommon subexpression eliminationGNU Compiler CollectionGlobal value numbering
(More)

Related mentions per year

Related mentions per year

1936-2018
19401960198020002020
Partial redundancy elimination
Value
Optimizing compiler
Static single assignment form
GNU Compiler Collection
Strength reduction

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2008
2008
Proof optimization for partial redundancy elimination
Partial redundancy elimination is a subtle optimization which performs common subexpression elimination and expression motion at… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 10
  • figure 11
Is this relevant?
2004
2004
Value-Based Partial Redundancy Elimination
Partial redundancy elimination (PRE) is a program transformation that identifies and eliminates expressions that are redundant on… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2003
2003
Partial Redundancy Elimination with Predication Techniques
Partial redundancy elimination (PRE) techniques play an important role in optimizing compilers. Many optimizations, such as… (More)
  • figure 1
Is this relevant?
2000
2000
Partial Redundancy Elimination on Predicated Code
Partial redundancy elimination (PRE) is one of the most widespread optimizations in compilers. However, current PRE-techniques… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Partial redundancy elimination in SSA form
The SSAPRE algorithm for performing partial redundancy elimination based entirely on SSA form is presented. The algorithm is… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1999
1999
Partial Redundancy Elimination in SSA
The SSAPRE algorithm for performing partial redundancy elimination based entirely on SSA form is presented. The algorithm is… (More)
Is this relevant?
1999
1999
Partial Redundancy Elimination for Access Path Expressions
Pointer traversals pose significant overhead to the execution of object-oriented programs, since every access to an object’s… (More)
  • table I
  • figure 1
  • figure 2
  • table II
  • table III
Is this relevant?
1999
1999
Partial Redundancy Elimination is not Bidirectional
Classical partial redundancy elimination is typically presented as a bidirectional data-flow analysis. This paper argues that the… (More)
  • figure 1
  • figure 2
Is this relevant?
1997
1997
Partial Redundancy Elimination Driven by a Cost-Benefit Analysis
Partial redundancy elimination has become a major compiler optimization that subsumes various ad hoc code motion optimizations… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
Highly Cited
1994
Highly Cited
1994
Effective Partial Redundancy Elimination
Partial redundancy elimination is a code optimization with a long history of literature and implementation. In practice, its… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 4
Is this relevant?