Thumbnail
Access Restriction
Subscribed

Author Morel, E. ♦ Renvoise, C.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Compiler ♦ Compilation ♦ Boolean systems ♦ Optimizer ♦ Redundancy elimination ♦ Data flow analysis ♦ Partial redundancy ♦ Invariant computation elimination ♦ Optimization
Abstract The elimination of redundant computations and the moving of invariant computations out of loops are often done separately, with invariants moved outward loop by loop. We propose to do both at once and to move each expression directly to the entrance of the outermost loop in which it is invariant. This is done by solving a more general problem, i.e. the elimination of computations performed twice on a given execution path. Such computations are termed partially redundant. Moreover, the algorithm does not require any graphical information or restrictions on the shape of the program graph. Testing this algorithm has shown that its execution cost is nearly linear with the size of the program, and that it leads to a smaller optimizer that requires less execution time.
Description Affiliation: CII Honeywell Bull, Louveciennes, France (Morel, E.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 22
Issue Number 2
Page Count 8
Starting Page 96
Ending Page 103


Open content in new tab

   Open content in new tab
Source: ACM Digital Library