A simple algorithm for partial redundancy elimination

ABSTRACT

Partial redundancy elimination was originally formulated as a bidirectional, bit-vector, data-flow analysis problem by Morel and Renvoise. Dhamdhere improved the original algorithm using the concept of edge placement. Knoop, Rüthing, and Steffen viewed the problem within a framework that required only four unidirectional analyses for an optimal solution. Here, we propose an algorithm for partial redundancy elimination based on well known concepts, viz., availability, anticipability, partial availability, and partial anticipability. The algorithm is both computationally and lifetime optimal. Our algorithm also requires four unidirectional data-flow analyses. The main advantage of the algorithm is its simplicity.

INDEX TERMS

Primary Classification:
  G. Mathematics of Computing
  G.4 MATHEMATICAL SOFTWARE
      Subjects: Algorithm design and analysis

Additional Classification:
  D. Software
  D.3 PROGRAMMING LANGUAGES

  G. Mathematics of Computing
  G.2 DISCRETE MATHEMATICS

General Terms:
Algorithms, Design, Languages, Performance, Reliability, Theory, Verification