J. Ferrante and K. J. Ottenstein, `A program form based on data dependency in predicate regions', Conference Record of the Tenth Annual ACM Symposium on Principles of Programming Languages, Austin, Texas, 24--26 January 1983, pp. 217--236.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....loop nest. 7. RELATED WORK 7. 1 Linear Induction Variables and Strength Reduction An early paper on program dependence graphs by Ferrante and Ottenstein suggests that basic linear IVs may be found by identifying strongly connected components of subgraphs corresponding to loops in the program [Ferrante and Ottenstein 1983]. Unsurprisingly, their representation of program graphs has many features in common with SSA form, e.g. merge nodes, data dependence edges. Still earlier, Loveman and Faneuf noted that in their p graph representation variables introduced by strength reduction have two generations and one merge, ....

Ferrante, J. and Ottenstein, K. J. 1983. A program form based on data dependency in predicate regions. In Conference Record of the Tenth Annual ACM Symposium on Principles of Programming Languages, pp. 217--236. ACM Press.

....data Chapter 7 Related Work 7. 1 Linear Induction Variables and Strength Reduction An early paper on program dependence graphs by Ferrante and Ottenstein suggests that basic linear IVs may be found by identifying strongly connected components of subgraphs corresponding to loops in the program [10]. Unsurprisingly, their representation of program graphs has many features in common with SSA form, e.g. merge nodes, data dependence edges. Still earlier, Loveman and Faneuf noted that in their p graph representation variables introduced by strength reduction have two generations and one merge, ....

Jeanne Ferrante and Karl J. Ottenstein. A program form based on data dependency in predicate regions. In Conference Record of the 10th Annual ACM Symposium on Principles of Programming Languages, New York, 217--236. ACM Press, New York, January 1983.

....data dependence tests should be applied. Further study is needed, particularly in analyzing pairwise comparisons of references to the same array at all levels in each loop nest. 7. RELATED WORK 7. 1 Linear Induction Variables and Strength Reduction An early paper on program dependence graphs by Ferrante and Ottenstein [1983] suggests that basic linear IVs may be found by identifying strongly connected components of subgraphs corresponding to loops in the program. Unsurprisingly, their representation of program graphs has many features in common with SSA form, 34 Delta Michael P. Gerlek and Eric Stoltz and Michael ....

Ferrante, J. and Ottenstein, K. J. 1983. A program form based on data dependency in predicate regions. In Conference Record of the 10th Annual ACM Symposium on Principles of Programming Languages. ACM Press, New York, 217--236.

....on intermediate graph representations to express the essential control and data dependences of atomic program operations. Some prominent examples in the literature are the control flow graph, the call graph, the def use chain [1] the data dependence graph [7] and the extended data flow graph [2]. Recently, Ferrante, Ottenstein, and Warren [3] proposed a comprehensive graph representation called the program dependence graph (pdg) that is suitable for scalar optimization [3, 8] vectorization [14] and general parallelization [15] Subsequently, Horwitz, Prins, and Reps [4] revised the pdg ....

....to these identifiers within the preceding computation. This process can be repeated to identify all of the data dependences in the program. In fact, we could perform a staging analysis as in Section 4. 3 to generate a structural form of program dependence graph similar to the pdgs presented in [2]. However, this form of pdg expresses data dependences between expressions and compound statements instead of between expressions and assignments. To analyze data dependence at the level of atomic assignments and predicates, we need to analyze control information as well. 4.2 Control Dependence ....

Ferrante, J. and K. Ottenstein. A program form based on data dependency in predicate regions. In Proc. 10th ACM Symposium on Principles of Programming Languages , 1983, 217--236.

....it can be developed in an almost language independent way based on the complexity of mathematical operations. It has been successfully adapted to various languages and language paradigms. The idea is seen in ad hoc form as the low level optimization by strength reduction[Cocke and Kennedy 1977; Ferrante and Ottenstein 1983; Cai and Paige 1995] It has been formalized and used extensively in database applications to concrete view maintenance, integrity control, and trigger implementation[Koenig and Paige 1981] The use of dynamic indexes to cut down on database search is another example. Finite differencing should ....

Ferrante, J. and Ottenstein, K. J. 1983. A program form based on data dependency in predicate regions (Austin, Tex., Jan. 1983). pp. 217--236.

No context found.

J. Ferrante and K. J. Ottenstein, `A program form based on data dependency in predicate regions', Conference Record of the Tenth Annual ACM Symposium on Principles of Programming Languages, Austin, Texas, 24--26 January 1983, pp. 217--236.

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