A new algorithm for partial redundancy elimination based on SSA form

  • Authors:

  • Fred Chow;Sun Chan;Robert Kennedy;Shin-Ming Liu;Raymond Lo;Peng Tu

  • Affiliations:

  • Silicon Graphics Computer Systems, 2011 N. Shoreline Blvd., Mountain View, CA;Silicon Graphics Computer Systems, 2011 N. Shoreline Blvd., Mountain View, CA;Silicon Graphics Computer Systems, 2011 N. Shoreline Blvd., Mountain View, CA;Silicon Graphics Computer Systems, 2011 N. Shoreline Blvd., Mountain View, CA;Silicon Graphics Computer Systems, 2011 N. Shoreline Blvd., Mountain View, CA;Silicon Graphics Computer Systems, 2011 N. Shoreline Blvd., Mountain View, CA

  • Venue:
  • Proceedings of the ACM SIGPLAN 1997 conference on Programming language design and implementation
  • Year:
  • 1997

Quantified Score

Hi-index 0.00

Visualization

Abstract

A new algorithm, SSAPRE, for performing partial redundancy elimination based entirely on SSA form is presented. It achieves optimal code motion similar to lazy code motion [KRS94a, DS93], but is formulated independently and does not involve iterative data flow analysis and bit vectors in its solution. It not only exhibits the characteristics common to other sparse approaches, but also inherits the advantages shared by other SSA-based optimization techniques. SSAPRE also maintains its output in the same SSA form as its input. In describing the algorithm, we state theorems with proofs giving our claims about SSAPRE. We also give additional description about our practical implementation of SSAPRE, and analyze and compare its performance with a bit-vector-based implementation of PRE. We conclude with some discussion of the implications of this work.