Loveman, D. B. and Faneuf, R. A. 1975. Program optimization -- theory and practice. In Proceedings of a Conference on Programming Languages and Compilers for Parallel and Vector Machines, pp. 97--102. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Beyond Induction Variables: Detecting and Classifying.. - Gerlek, Stoltz, Wolfe (1995) (62 citations) (Correct)
....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, and all uses are generated by the merge [Loveman and Faneuf 1975], which is closely related to our property of functions. Although developed independently, our work may be viewed as a (much expanded) current treatment of these early ideas. Classical linear induction variable detection for strength reduction, particularly of array expressions, is well covered ....
Loveman, D. B. and Faneuf, R. A. 1975. Program optimization -- theory and practice. In Proceedings of a Conference on Programming Languages and Compilers for Parallel and Vector Machines, pp. 97--102.
Beyond Induction Variables: Detecting and Classifying Sequences.. - Gerlek (1996) (62 citations) (Correct)
....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, and all uses are generated by the merge, which is closely related to our property of functions [16]. Although developed independently, our work may be viewed as a (much expanded) current treatment of these early ideas. Classical linear induction variable detection for strength reduction, particularly of array expressions, is well covered in the literature. The usual approach is to use ....
David B. Loveman and Ross A. Faneuf. Program optimization -- Theory and practice. In Proceedings of a Conference on Programming Languages and Compilers for Parallel and Vector Machines, 97--102. ACM Press, New York, March 1975. 59
Beyond Induction Variables: Detecting and Classifying.. - Gerlek, Stoltz, Wolfe (1995) (62 citations) (Correct)
....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 Wolfe e.g. merge nodes, data dependence edges. Still earlier, Loveman and Faneuf [1975] noted that in their p graph representation variables introduced by strength reduction have two generations and one merge, and all uses are generated by the merge, which is closely related to our property of functions. Although developed independently, our work may be viewed as a (much ....
Loveman, D. B. and Faneuf, R. A. 1975. Program optimization -- Theory and practice. In Proceedings of a Conference on Programming Languages and Compilers for Parallel and Vector Machines. ACM Press, New York, 97--102.
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