Optimizing for reduced Code space using genetic algorithms

Proceedings of the ACM SIGPLAN Conference on Languages, Compilers, and Tools for Embedded Systems (LCTES)

Volumn Part F129197, Issue , 1999, Pages 1-9

  Cooper, Keith D ^a   Schielke, Philip J ^a   Subramanian, Devika ^a  

^a Rice University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); GENETIC ALGORITHMS; OPTIMIZATION; PROGRAM COMPILERS;

COMPILE TIME; COMPILER OPTIMIZATIONS; CRITICAL ISSUES; FIXED SEQUENCE; RANDOM OPTIMIZATION; REGISTER ALLOCATION; SMALL OBJECTS; SOFTWARE DESIGNERS;

EMBEDDED SYSTEMS;

EID: 85016062555     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/314403.314414     Document Type: Conference Paper

References (22)

1. Steven John Beaty. Instruction Scheduling Using Genetic Algorithms. PhD thesis, Colorado State University, Fort Collins, Colorado, 1991.
2. Preston Briggs and Keith D. Cooper. Effective partial redundancy elimination. SIGPLAN Notices, 29(6):159-170, June 1994. Proceedings of the ACM SIGPLAN'94 Conference on Programming Language Design and Implementation.
3. Preston Briggs, Keith D. Cooper, and L. Taylor Simpson. Value numbering. Software - Practice and Experience, 27(6):701-724, June 1997.
4. Preston Briggs, Keith D Cooper, and Linda Torczon. Improvements to graph coloring register allocation. ACM Transactions on Programming Languages and Systems, 16(3):428-455, May 1994.
5. Gregory J. Chaitin, Marc A. Auslander, Ashok K. Chandra, John Cocke, Martin E. Hopkins, and Peter W. Markstein. Register allocation via coloring. Computer Languages, 6(1):47-57, January 1981.
6. Keith D. Cooper and L. Taylor Simpson. Sec-based value numbering. Technical Report CRPC-TR95636-S, Center for Research on Parallel Computation, Rice University, 1995.
7. Keith D. Cooper, L. Taylor Simpson, and Chris A Vick. Operator strength reduction. Technical Report CRPC-TR95635-S, Center for Research on Parallel Computation, Rice University, 1995.
8. Ron Cytron, Jeanne Ferrante, Barry K. Rosen, Mark N. Wegman, and F. Kenneth Zadeck. Efficiently computing static single assignment form and the control dependence graph. ACM Transactions on Programming Languages and Systems, 13(4):451-490, October 1991.
9. Lawrence Davis, editor. Handbook of Genetic Algorithms. Van Nostrand Reinhold, 1991.
10. Karl-Heinz Drechsler and Manfred P. Stadel. A solution to a problem with Morel and Renvoise's "Global optimization by suppression of partial redundancies". ACM Transactions on Programming Languages and Systems, 10(4):635-640, October 1988.
11. Karl-Heinz Drechsler and Manfred P. Stadel. A variation of Knoop, Rüthing, and Steffen's "lazy code motion". SIGPLAN Notices, 28(5):29-38, May 1993.
12. G. E. Forsythe, M. A. Malcolm, and C. B. Moler. Computer Methods for Mathematical Computations. Prentice-Hall, Inc., Englewood Cliffs, NJ, 1977.
13. David E. Goldberg. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesly, 1989.
14. John H. Holland. Adaptation in natural and artificial systems. University of Michigan Press, 1975.
15. Ken Kennedy. A survey of data flow analysis techniques. In Steven S. Muchnick and Neil D. Jones, editors, Program Flow Analysis: Theory and Applications. Prentice-Hall, 1981.
16. Jens Knoop, Oliver Rüthing, and Bernhard Steffen. Optimal code motion: Theory and practice. ACM Transactions on Programming Languages and Systems, 16(4):1117-1155, July 1994.
17. Melanie Mitchell. An introduction to genetic algorithms. MIT Press, 1998.
18. Etienne Morel and Claude Renvoise. Global optimization by suppression of partial redundancies. Communications of the ACM, 22(2):96-103, February 1979.
19. Andy P Nisbet. GAPS: A compiler framework for genetic algorithm (GA) optimised parallelisation. In Poster Session at The International Conference and Exhibition on High-Performance Computing and Networking, HPCN Europe'98, 1998.
20. Randolph G. Scarborough and Harwood G. Kolsky. Improved optimization of FORTRAN object programs. IBM Journal of Research and Development, pages 660-676, November 1980.
21. L. Taylor Simpson. Value-Driven Redundancy Elimination. PhD thesis, Rice University, May 1996.
22. Mark N. Wegman and F. Kenneth Zadeck. Constant propagation with conditional branches. ACM Transactions on Programming Languages and Systems, 13(2):181-210, April 1991.