A simple algorithm for partial redundancy elimination

Authors:
Vineeth Kumar Paleri;Y. N. Srikant;Priti Shankar
Affiliations:
Department of Computer Science and Automation, Indian Institute of Science, Bangalore-560012;Department of Computer Science and Automation, Indian Institute of Science, Bangalore-560012;Department of Computer Science and Automation, Indian Institute of Science, Bangalore-560012
Venue:
ACM SIGPLAN Notices
Year:
1998

Citing 0
Cited 7

E-path_PRE: partial redundancy elimination made easy

ACM SIGPLAN Notices
Bidirectional data flow analysis: myths and reality

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

Science of Computer Programming
Lazy code motion

ACM SIGPLAN Notices - Best of PLDI 1979-1999
Generating Java Compiler Optimizers Using Bidirectional CTL

Electronic Notes in Theoretical Computer Science (ENTCS)
A fresh look at PRE as a maximum flow problem

CC'06 Proceedings of the 15th international conference on Compiler Construction
Bidirectional data flow analysis for type inferencing

Computer Languages, Systems and Structures

Quantified Score

Hi-index	0.00

Visualization

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.