Alfons Geser, Jens Knoop, Gerald Luttgen, Oliver Ruthing, and Bernhard Ste#en. Nonmonotone fixpoint iterations to resolve second order e#ects. In Tibor Gyimothy, editor, Compiler Construction, 6th International Conference, volume 1060 of Lecture Notes in Computer Science, pages 106--120, Linkoping, Sweden, 24--26 April 1996. Springer. ISBN ISBN 3-54061053 -7. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Optimization of Data Remapping in Data-Parallel Languages - Mehofer (1998) (Correct)
....simply count assignments independently of the assignment pattern, but counts for each assignment pattern the number of assignments. This relation specifies a very strict condition which allows to define optimality without taking execution costs of individual assignments into account. As proved in [31] the program resulting from PDCE is best (optimal) it is better (in the strict sense as defined above) than any other program in the program set G pdce . In particular, the program finally resulting from PDCE does not depend on the specific order of the elementary transformations: it is uniquely ....
....the strict sense as defined above) than any other program in the program set G pdce . In particular, the program finally resulting from PDCE does not depend on the specific order of the elementary transformations: it is uniquely determined up to (irrelevant) local reorderings in basic blocks (cf. [31, 53]) CHAPTER 4. MAPPING ASSIGNMENT PLACEMENT 62 4.4.4 Partially Redundant Assignment Elimination (PRAE) PRAE is conceptually dual to PDCE: assignment hoistings (AH) move assignments as far as possible in the opposite direction of the control flow in order to place them in a context as universal as ....
A. Geser, J. Knoop, G. Luttgen, O. Ruthing, and B. Steffen. Non-monotone fixpoint iterations to resolve second order effects. In Proceedings of the 6th International Conference on Compiler Construction (CC'96) (Linkoping, Sweden), Lecture Notes in Computer Science, vol. 1060, pages 106 -- 120. Springer-Verlag, Heidelberg, Germany, 1996.
Distribution Assignment Placement: A New Aggressive Approach.. - Knoop, Mehofer (1997) Self-citation (Knoop) (Correct)
....until the program stabilizes. This is conveniently expressed by means of the following regular expression like term PDCE j (AS DCE) where AS and DCE denote a single application of the assignment sinking and dead assignment elimination procedure to all assignment patterns of P. As proved in [9] the program resulting from PDCE is best (optimal) it is better than any other program in the set of programs G pcde = df fG 0 j G (AS DCE) G 0 g derivable from G by means of sequences of admissible assignment sinkings and dead code eliminations, where a program G 0 2 G pcde is better ....
....at program points satisfying N INSERT or X INSERT. c For the ease of presentation the equations are specified at instruction level. PDCE does not depend on the specific order of the elementary transformations: it is uniquely determined up to (irrelevant) local reorderings in basic blocks (cf. [9, 15]) 5.2 Partially Redundant Assignment Elimination PRAE is conceptually dual to PDCE: assignment hoistings (AH) move assignments as far as possible in the opposite direction of the control flow in order to place them in a context as universal as possible. Intuitively, this maximizes the potential ....
A. Geser, J. Knoop, G. Luttgen, O. Ruthing, and B. Steffen. Non-monotone fixpoint iterations to resolve second order effects. In Proceedings of the 6th International Conference on Compiler Construction (CC'96) (Linkoping, Sweden), Lecture Notes in Computer Science, vol. 1060, pages 106 -- 120. SpringerVerlag, Heidelberg, Germany, 1996.
Active Libraries and Universal Languages - Veldhuizen (2004) (1 citation) (Correct)
No context found.
Alfons Geser, Jens Knoop, Gerald Luttgen, Oliver Ruthing, and Bernhard Ste#en. Nonmonotone fixpoint iterations to resolve second order e#ects. In Tibor Gyimothy, editor, Compiler Construction, 6th International Conference, volume 1060 of Lecture Notes in Computer Science, pages 106--120, Linkoping, Sweden, 24--26 April 1996. Springer. ISBN ISBN 3-54061053 -7.
A Fixpoint Theory for Non-monotonic Parallelism - Chen (2002) (Correct)
No context found.
A. Geser and et al. Non-monotone fixpoint iterations to resolve second-order e#ects. In 6th Intl. Symp. Compiler Construction, volume 1060 of LNCS, pages 106--120, 1996.
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