Partial redundancy elimination: a simple, pragmatic, and provably correct algorithm

  • Authors:

  • V. K. Paleri;Y. N. Srikant;P. Shankar

  • Affiliations:

  • Department of Computer Science and Automation, Indian Institute of Science, Bangalore-560 012, India;Department of Computer Science and Automation, Indian Institute of Science, Bangalore-560 012, India;Department of Computer Science and Automation, Indian Institute of Science, Bangalore-560 012, India

  • Venue:
  • Science of Computer Programming
  • Year:
  • 2003

Quantified Score

Hi-index 0.01

Visualization

Abstract

We propose a new algorithm for partial redundancy elimination based on the new concepts of safe partial availability and safe partial anticipability. These new concepts are derived by the integration of the notion of safety into the definitions of partial availability and partial anticipability. The algorithm works on flow graphs whose nodes are basic blocks. It is both computationally and lifetime optimal and requires four unidirectional analyses. The most important feature of the algorithm is its simplicity; the algorithm evolves naturally from the new concept of safe partial availability.