Optimal code motion in the presence of large expressions

Proceedings of the IEEE International Conference on Computer Languages

Volumn , Issue , 1998, Pages 216-225

  Ruething, Oliver ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; DATA PROCESSING; GRAPH THEORY; POLYNOMIALS; PROGRAM PROCESSORS;

LAZY CODE MOTION; PARTIAL REDUNDANCY ELIMINATION (PRE);

CODES (SYMBOLS);

EID: 0031627860     PISSN: 10748970     EISSN: None     Source Type: None    
DOI: 10.1109/ICCL.1998.674172     Document Type: Conference Paper

References (18)

1. C. Berge Two theorems in graph theory Proc. Nat. Acad. Set. 842 844 Proc. Nat. Acad. Set. USA 1957
2. D. Berson R. Gupta M. L. Soffa URSA: A unified Re-Source allocator for registers and functional units in VLIW architectures Conference on Architectures and Compilation Techniques for Fine and Medium Grain Parallelism 243 254 Conference on Architectures and Compilation Techniques for Fine and Medium Grain Parallelism Orlando Florida 1993-January
3. G. J. Chaitin M. A. Auslander A. K. Chandra J. Cocke M. E. Hopkins P. W. Markstein Register allocation via coloring Journal of Computer Languages 6 47 57 1981
4. F. Chow S. Chan R. Kennedy S.-M. Liu R. Lo P. Tu A new algorithm for partial redundancy elimination based on SSA form Proc. ACM SIGPLAN Conference on Programming Language Design and Implementation'97 32 273 286 Proc. ACM SIGPLAN Conference on Programming Language Design and Implementation'97 Philadelphia PA 1997-May
5. D. M. Dhamdhere A fast algorithm for code movement optimization ACM SIGPLAN Notices 23 10 172 180 1988
6. D. M. Dhamdhere A new algorithm for composite hoisting and strength reduction optimisation (+ Corrigendum) International Journal of Computer Mathematics 27 1 14 1989
7. D. M. Dhamdhere Practical adaptation of the global optimization algorithm of Morel and Renvoise ACM Transactions on Programming Languages and Systems 13 2 291 294 1991
8. D. M. Dhamdhere B. K. Rosen F. K. Zadeck How to analyze large programs efficiently and informatively Proc. ACM SIGPLAN Conference on Programming Language Design and Implementation'92 27,7 212 223 Proc. ACM SIGPLAN Conference on Programming Language Design and Implementation'92 San Francisco CA 1992-June
9. K.-H. Drechsler M. P. Stadel Global optimization by suppression of partial redundancies ACM Transactions on Programming Languages and Systems 10 4 635 640 1988
10. K.-H. Drechsler M. P. Stadel A variation of Knoop, Rüthing and Steffen's lazy code motion ACM SIGPLAN Notices 28 5 29 38 1993
11. J. E. Hopcroft R. M. Karp An n5/2 algorithm for maximum matchings in bipartite graphs SIAM Journal on Computing 2 4 225 231 1973
12. J. Knoop O. Rüthing B. Steffen Lazy code motion Proc. ACM SIGPLAN Conference on Programming Language Design and Implementation'92 27,7 224 234 Proc. ACM SIGPLAN Conference on Programming Language Design and Implementation'92 San Francisco CA 1992-June
13. J. Knoop O. Rüthing B. Steffen Optimal code motion: Theory and practice ACM Transactions on Programming Languages and Systems 16 4 1117 1155 1994
14. J. Knoop O. Rüthing B. Steffen The power of assignment motion Proc. ACM SIGPLAN Conference on Programming Language Design and Implementation'95 30,6 233 245 Proc. ACM SIGPLAN Conference on Programming Language Design and Implementation'95 La Jolla CA 1995-June
15. L. Lovasz M. D. Plummer Matching Theory 29 1986 North Holland
16. E. Morel C. Renvoise Global optimization by suppression of partial redundancies Communications of the ACM 22 2 96 103 1979
17. O. Rüthing Interacting Code Motion Transformations. Their Impact and their complexity 1997 Christian-Albrechts-Universität Kiel Germany http://sunshine.cs.uni-dortmund.de/staff/~ruething/diss.ps
18. A. Sorkin Global optimization by suppression of partial redundancies ACM Transactions on Programming Languages and Systems 11 4 666 668 1989