V. Maslov. Enhancing array dataflow dependence analysis with on-demand global value propagation. In Proc. International Conference on Supercomputing, pages 265--269, July 1995. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Fractal Symbolic Analysis for Program Transformations - Nikolay Mateev Vijay (2000) (Correct)
....symbolic expressions are syntactically identical in each case. Thus, the compiler is able to demonstrate the equality of the simplified programs and, therefore, the programs in Figure 16. Note that the programs are only equivalent given that p(j) j. Techniques such as value propagation [16, 7] have been developed to perform this type of analysis for indirect array accesses to more accurately compute dependences. It is clear that this information may easily be inferred from the pivot computation in B1.a and B1.b. This information should be passed by the compiler as bindings to the ....
V. Maslov. Enhancing array dataflow dependence analysis with on-demand global value propagation. In Proc. International Conference on Supercomputing, pages 265--269, July 1995.
Automatic Parallelization: An Incremental, Optimistic, Practical .. - Schwartz (1999) (Correct)
....with application size, and the quadratic asymptotic complexity of comparing every pair of references scales poorly. Non a#ne subscripts cannot be easily compared. Procedure boundaries can make reference pairs di#cult to relate, sometimes requiring elaborate value propagation techniques[Mas95] To cope with these and other problems, array summarization techniques which can represent the aggregate activity for a set of accesses have been proposed. To find potential dependences, these summary sets can be much more quickly intersected with one another than the corresponding individual ....
V. Maslov. Enhancing Array Dataflow Dependence Analysis With Ondemand Global Value Propagation. In Proceedings of the 1995 International Conference on Supercomputing, pages 265--269, 1995.
Fractal Symbolic Analysis for Program Transformations - Mateev, Menon, Pingali (2000) (Correct)
No context found.
V. Maslov. Enhancing array dataflow dependence analysis with on-demand global value propagation. In Proc. International Conference on Supercomputing, pages 265--269, July 1995.
Fractal Symbolic Analysis - Mateev, Menon, Pingali (2001) (3 citations) (Correct)
No context found.
V. Maslov. Enhancing array dataflow dependence analysis with on-demand global value propagation. In Proc. International Conference on Supercomputing, pages 265--269, July 1995.
Value Range Analysis of Conditionally Updated Variables .. - Birch, van Engelen.. (2004) (Correct)
No context found.
MASLOV, V. Enhancing array dataflow dependence analysis with on-demand global value propagation. In 9 ACM International Conference on Supercomputing (Barcelona, Spain, July 1995), ACM Press, pp. 265--269.
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