A faster optimal register allocator

Proceedings of the Annual International Symposium on Microarchitecture, MICRO

Volumn 2002-January, Issue , 2002, Pages 245-256

  Fu, Changqing ^a   Wilken, Kent ^a  

^a University of California   (United States)

Author keywords

Computer architecture; Degradation; Embedded system; Energy consumption; Integer linear programming; Microarchitecture; Optimizing compilers; Program processors; Registers

Indexed keywords

C (PROGRAMMING LANGUAGE); COMPUTER ARCHITECTURE; COMPUTER PROGRAMMING; COMPUTER SYSTEMS PROGRAMMING; DATA FLOW ANALYSIS; DEGRADATION; EMBEDDED SYSTEMS; ENERGY UTILIZATION; FLOW GRAPHS; GENERAL PURPOSE COMPUTERS; INTEGER PROGRAMMING; PROGRAM PROCESSORS;

GENERAL PURPOSE PROCESSORS; HIERARCHICAL REDUCTION; INTEGER LINEAR PROGRAMMING; MICRO ARCHITECTURES; OPTIMIZING COMPILERS; REDUCTION TECHNIQUES; REGISTER ALLOCATION; REGISTERS;

PROGRAM COMPILERS;

EID: 38149085329     PISSN: 10724451     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/MICRO.2002.1176254     Document Type: Conference Paper

References (28)

1. A. Aho, R. Sethi, and J. Ullman. Compilers: Principles, Techniques, and Tools. Addison-Wesley, 1988.
2. A. W. Appel and L. George. Optimal spilling for cisc machines with few registers. In SIGPLAN conference on Programming language design and implementation, June 2001.
3. D. Bernstein, M. C. Golumbic, Y. Mansour, R. Y. Pinter, D. Q. Goldin, H. Krawczyk, and I. Nahshon. Spill code minimization techniques for optimizing compilers. In SIGPLAN conference on Programming language design and implementation, volume 24, pages 258-263, Portland, OR, 1989.
4. M. P. Bivens. Incremental register reallocation. volume 20, pages 1015-047, October 1990.
5. P. Briggs. Register Allocation via Graph Coloring. PhD thesis, Rice University, April 1992.
6. P. Briggs, K. Cooper, and L. Torczon. Improvements to graph coloring register allocation. ACM Transactions on Programming Languages and Systems, 16(3):428-455, May 1994.
7. R. G. Burger, O. Waddell, and R. K. Dybvig. Register allocation using lazy saves, eager restores, and greedy shufing. In SIGPLAN conference on Programming language design and implementation, Feburary 1995.
8. D. Callahan and B. Koblenz. Register allocation via hierarchical graph coloring. In Proceedings of Conference on Programming Language Design and Implementation, pages 192-203, June 1991.
9. G. Chatin, M. Auslander, A. Chandra, J. Cocke, M. Hopkins, and P. Markstein. Register allocation via coloring. Computer Languages, 6:47-57, 1981.
10. F. Chow and J. Hennessey. The priority-based coloring approach to register allocation. ACM Trans. on Programming Languages and Systems, 12(4):501-536, October 1990.
11. L. P. Cindy Norris, Lori. Register allocation over the program dependence graph. In SIGPLAN conference on Programming language design and implementation, Florida, Orlando, 1994.
12. CPLEX Optimization, Inc. Using the CPLEX Callable Library. 1994.
13. Farach and Liberatore. On local register allocation. In SODA: ACM-SIAM Symposium on Discrete Algorithms (A Conference on Theoretical and Experimental Analysis of Discrete Algorithms), 1998.
14. C. W. Fraser and D. R. Hanson. Simple register spilling in a retargetable compiler. Software-Practice and Experience, 22(1):85-99, January 1992.
15. R. A. Freiburghouse. Register allocation via usage counts. CACM, 17:638-642, 1974.
16. D. Goodwin. Optimal and Near-Optimal Global Register Allocation. PhD thesis, University of California, Davis, December 1996.
17. D. Goodwin and K. Wilken. Optimal and near-optimal global register allocation using 0-1 integer programming. Software Practice and Experience, 26(8):929-965, August 1996.
18. T. G. Guei-Yuan Lueh and A.-R. Adl-Tabatabai. Global register allocation based on graph fusion. In 9th Workshop on Languages and Compilers for Parallel Computing, August 1996.
19. R. Johnson, D. Pearson, and K. Pingali. The program structure tree: Computing control regions in linear time. ACM SIGPLAN Notices, 29:171-185, 1994.
20. T. Kong and K. D. Wilken. Precise register allocation for irregular architectures. In International Symposium on Microarchitecture, pages 297-307, 1998.
21. E. Lowry and C. Medlock. Object code optimization. CACM, 12:13-22, 1969.
22. M. R. Gary and D. Johnson. computers and Intractability:A Guide to the to the Theory of NPCompleteness. San Fransisco: W. H. Freeman, 1979.
23. M. Naik and J. Palsberg. Compiling with code-size constraints. In Proceedings of Languages, Compilers, and Tools for Embedded Systems (LCTES), June 2002.
24. G. Nemhauser and L. Wolsey. Integer and Combinatorial Optimization. John Wiley & Sons, 1988.
25. D. E. M. O. K. Peter Bergner, Peter Dahl. Spill code minimization via interference region spilling. In SIGPLAN conference on Programming language design and implementation, May 1997.
26. M. S. R. Gupta and T. Steele. Register allocation via clique separators. SIGPLAN conference on Programming language design and implementation, 25:264-274, 1989.
27. R. Sethi. Complete register allocation problems. SIAM Journal on Computing, 4(3):226-248, September 1975.
28. Y. Zhang, X. Hu, and D. Chen. Low energy register allocation beyond basic blocks, 1999.