Paper Info
Title
Partial Redundancy Elimination on Predicated Code
Abstract
Abstract Partial redundancy elimination (PRE) is one of the most widespread optimiza - tions in compilers However, current PRE - techniques are inadequate to handle predicated code , i e , programs where instructions are guarded by a 1 - bit register that dynamically controls whether the e ect of instruction should be committed or nulli ed In fact, to exclude corrupting the semantics they must be overly con - servative making them close to useless Since predicated code will be more and more common with the advent of the IA - 64 architecture, we present here a family of PRE - algorithms tailored for predicated code Conceptually, the basic element of this family can be considered the counterpart of busy code motion of [20] It can easily be tuned by two orthogonal means First, by adjusting the power of a prepro - cess feeding it by information on predication Second, by relaxing or strengthening the constraints on synthesizing predicates controlling the movability of computa - tions Together with extensions towards lazy code motion , this results in a family of PRE - algorithms spanning a range from tamed to quite aggressive algorithms, which is illustrated by various meaningful examples
Year
DOI
Venue
2000
10.1007/978-3-540-45099-3_14
SAS
Keywords
Field
DocType
data-flow analysis,lazy code motion,partial redundancy elimination,predicated code,busy code motion,optimization.,ia-64,data flow analysis,optimization
Programming language,Program transformation,Computer science,Data-flow analysis,Real-time computing,Theoretical computer science,Optimizing compiler,Distributed computing,Program optimization,Partial redundancy elimination,Compiler,Semantics,IA-64
Conference
Volume
ISSN
ISBN
1824
0302-9743
3-540-67668-6
Citations 
PageRank 
References 
4
0.40
25
Authors
3
Name
Order
Citations
PageRank
Jens Knoop183874.76
Jean-François Collard224721.24
Roy Dz-ching Ju332621.37