Interprocedural partial redundancy elimination with application to distributed memory compilation

1998 ◽  
Vol 9 (7) ◽  
pp. 609-625 ◽  
Author(s):  
G. Agrawal
Keyword(s):  
Distributed Memory ◽  
Redundancy Elimination ◽  
Partial Redundancy Elimination ◽  
Partial Redundancy

Effective partial redundancy elimination

1994 ◽  
Vol 29 (6) ◽  
pp. 159-170 ◽  
Author(s):  
Preston Briggs ◽  
Keith D. Cooper
Keyword(s):  
Redundancy Elimination ◽  
Partial Redundancy Elimination ◽  
Partial Redundancy

Predicated Partial Redundancy Elimination using a Cost Analysis

2003 ◽  
Vol 13 (04) ◽  
pp. 525-536
Author(s):  
Bernhard Scholz ◽  
Eduard Mehofer ◽  
Nigel Horspool
Keyword(s):  
Cost Analysis ◽  
Cost Model ◽  
Code Size ◽  
Redundancy Elimination ◽  
Key Technology ◽  
Flow Information ◽  
Partial Redundancy Elimination ◽  
The Cost ◽  
Traditional Approaches ◽  
Partial Redundancy

Partial redundancy elimination (PRE) is a key technology for modern compilers. However traditional approaches are conservative and fail to exploit many opportunities for optimization. New PRE approaches which greatly increase the number of eliminated redundancies have been developed. However, they either cause the code size to explode or they cannot handle statements with side-effects. In this paper we describe a predicated partial redundancy elimination (PPRE) approach which can potentially remove all partial redundancies. To avoid performance overheads caused by predication, PPRE is applied selectively based on a cost model. The cost analysis presented in the paper utilizes probabilistic data-flow information to decide whether PPRE is profitable for each instance of a partially redundant computation. Refinements of the basic PPRE transformation are described in detail. In contrast to some other approaches our transformation is strictly semantics preserving.

Sign in / Sign up

Export Citation Format

Share Document