| Preston Briggs, Linda Torczon, and Keith D. Cooper. Using conditional branches to improve constant propagation. Technical Report CRPC-TR95533, Center for Research on Parallel Computation, Rice University, April 1995. |
....Related Work Several previous systems have developed techniques for propagating and using constraint information for different purposes. These include debugging [7] optimizing array bounds checking [11, 17] improving dependence analysis [5] array privatization [5, 23] and constant propagation [8]. Our work is specifically aimed at optimizing the control flow generated by a parallelizing compiler. This has led to two principal differences between our approach and those used in previous systems. First, most previous systems use iterative dataflow techniques to determine value ranges of ....
.... using techniques based on Fourier Motzkin elimination[19] Most previous work on analysis of constraints on variable values has focused on much simpler cases, in particular, value ranges delimited by constants [6, 7, 17, 18] ranges delimited by symbolics [11, 5, 23] or equality constraints [8]. Johnson [14] uses the most similar constraint representation which consists of unquantified logical assertions about variable values. Omega s support for quantified formulae enables us to reason about strided sequences of values which can be important for analysis of data parallel codes ....
Preston Briggs, Linda Torczon, and Keith D. Cooper. Using conditional branches to improve constant propagation. Technical Report CRPC-TR95533, Center for Research on Parallel Computation, Rice University, April 1995.
No context found.
Preston Briggs, Linda Torczon, and Keith D. Cooper. Using conditional branches to improve constant propagation. Technical Report CRPC-TR95533, Center for Research on Parallel Computation, Rice University, April 1995.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC