Show simple item record

dc.contributor.authorSimpson, Loren Taylor
dc.date.accessioned 2017-08-02T22:03:30Z
dc.date.available 2017-08-02T22:03:30Z
dc.date.issued 1996-04
dc.identifier.urihttps://hdl.handle.net/1911/96461
dc.descriptionThis work was also published as a Rice University thesis/dissertation: http://hdl.handle.net/1911/16942
dc.description.abstract Value-driven redundancy elimination is a combination of value numbering and code motion. Value numbering is an optimization that assigns numbers to values in such a way that two values are assigned the same number if the compiler can prove they are equal. When this optimization discovers two computations that produce the same value, it can (under certain circumstances) eliminate one of them. Code motion is an optimization that attempts to move instructions to less frequently executed locations. Traditional techniques must assume that every definition produces a distinct value. Therefore, an instruction cannot move past a definition of one of its subexpressions. This restriction can be relaxed when certain definitions are known to produce redundant values. By understanding how these two optimizations interact, we can simplify each of them, and the resulting combination will be more powerful than the sum of the two parts. Value numbering will be simpler because it need not be concerned with eliminating instructions, and code motion will be simpler because identifying subexpressions is not necessary. This research investigates this value-driven approach to redundancy elimination. We improve upon the known algorithms for both value numbering and code motion, and we show experimental evidence of their effectiveness.
dc.format.extent 150 pp
dc.language.iso eng
dc.rights You are granted permission for the noncommercial reproduction, distribution, display, and performance of this technical report in any format, but this permission is only for a period of forty-five (45) days from the most recent time that you verified that this technical report is still available from the Computer Science Department of Rice University under terms that include this permission. All other rights are reserved by the author(s).
dc.title Value-Driven Redundancy Elimination
dc.type Technical report
dc.date.note April 1996
dc.identifier.digital TR96-308
dc.type.dcmi Text
dc.identifier.citation Simpson, Loren Taylor. "Value-Driven Redundancy Elimination." (1996) https://hdl.handle.net/1911/96461.


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record