Cost-optimal code motion

ACM Transactions on Programming Languages and Systems

Volumn 20, Issue 6, 1998, Pages 1297-1322

  Hailperin, Max ^a  

^a GUSTAVUS ADOLPHUS COLLEGE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; PROGRAMMING THEORY;

LAZY CODE MOTION (LCM) ALGORITHM;

DATA FLOW ANALYSIS;

EID: 0032267445     PISSN: 01640925     EISSN: None     Source Type: Journal    
DOI: 10.1145/295656.295664     Document Type: Article

References (22)

1. ALLEN, F. E. 1969. Program optimization. In Annual Review in Automatic Programming, Vol. 5. Pergamon Press.
2. ALLEN F. E., COCKE, J., AND KENNEDY, K. 1981. Reduction of operator strength. In Program Flow Analysis: Theory and Applications, S. S. Muchnick and N. D. Jones, Eds. Prentice-Hall, Chapter 3, 79-101.
3. BODÍK, R., GUPTA, R., AND SOFFA, M. L. 1998. Complete removal of redundant expressions. SIGPLAN Not. 33, 5 (May), 1-14. Proceedings of the 1998 ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI).
4. CHAITIN, G. J. 1982. Register allocation and spilling via graph coloring. In Proceedings of the ACM SIGPLAN 82 Symposium on Compiler Construction. Association for Computing Machinery, 98-105.
5. CHAITIN, G. J., AUSLANDER, M. A., CHANDRA, A. K., COCKE, J., HOPKINS, M. E., AND MARKSTEIN, P. W. 1981. Register allocation via coloring. Comput. Lang. 6, 47-57.
6. CHOW, F., CHAN, S., KENNEDY, R., LIU, S.-M., LO, R., AND TU, P. 1997. A new algorithm for partial redundancy elimination based on SSA form. SIGPLAN Not. 32, 5 (May), 273-286. Proceedings of the 1997 ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI).
7. COCKE, J. AND KENNEDY, K. 1977. An algorithm for reduction of operator strength. Commun. ACM 20, 11 (Nov.), 850-856.
8. COOPER, K., SIMPSON, T., AND VICK, C. 1995. Operator strength reduction. Tech. Rep. CRPC-TR95635-S, Center for Research on Parallel Computation, Rice University. Oct.
9. DHAMDHERE, D. M. 1979. On an algorithm for operator strength reduction. Commun. ACM 22, 5 (May), 311-312.
10. DHAMDHERE, D. M. 1989. A new algorithm for composite hoisting and strength reduction optimisation. Int. J. Comput. Math. 27, 1-14, 31-32.
11. DHANESHWAR, V. M. AND DHAMDHERE, D. M. 1995. Strength reduction of large expressions. J. Program. Lang. 3, 95-120.
12. GUPTA, R., BERSON, D. A., AND FANG, J. Z. 1997. Resource-sensitive profile-directed data flow analysis for code optimization. In Proceedings of the 30th Annual IEEE/ACM Symposium on Microarchitecture. 358-368.
13. GUPTA, R., BERSON, D. A., AND FANG, J. Z. 1998. Path profile guided partial redundancy elimination using speculation. In Proceedings of the IEEE International Conference on Computer Languages. 230-239.
14. HORSPOOL, R. N. AND HO, H. C. 1997. Partial redundancy elimination driven by a cost-benefit analysis. In Proceedings of the 8th Israeli Conference on Computer Systems and Software Engineering. 111-118.
15. JOSHI, S. M. AND DHAMDHERE, D. M. 1982. A composite hosting-strength reduction transformation for global program optimization. Int. J. Comput. Math. 11, 21-41, 111-126.
16. KENNEDY, R., CHOW, F., DAHL, P., LIU, S.-M., LO, R., AND STREICH, M. 1998. Strength reduction via SSAPRE. In International Conference on Compiler Construction. Lecture Notes in Computer Science, vol. 1383. Springer-Verlag, 144-158.
17. KILDALL, G. A. 1973. A unified approach to global program optimization. In Conference Record of the ACM SIGACT/SIGPLAN Symposium on Principles of Programming Languages. ACM, New York, 194-206.
18. KNOOP, J. AND STEFFEN, B. 1991. Unifying strength reduction and semantic code motion. Tech. Rep. 91-28, Lehrstuhl für Informatik II, RWTH Aachen. This paper is an extended and revised version of the second part of Steffen et al. [1991].
19. KNOOP, J., RÜTHING, O., AND STEFFEN, B. 1993. Lazy strength reduction. J. Program. Lang. 1, 1, 71-91.
20. KNOOP, J., RÜTHING, O., AND STEFFEN, B. 1994. Optimal code motion: Theory and practice. ACM Trans. Program. Lang. Syst. 16, 4 (July), 1117-1155.
21. RÜTHING, O. 1998. Optimal code motion in the presence of large expressions. In Proceedings of the IEEE International Conference on Computer Languages. IEEE, New York, 215-226.
22. STEFFEN, B., KNOOP, J., AND RÜTHING, O. 1991. Efficient code motion and an adaption to strength reduction. In Proceedings of the 4th International Joint Conference on Theory and Practice of Software Development. Lecture Notes in Computer Science, vol. 494. Springer-Verlag, 394-415.