Optimal spilling for CISC machines with few registers

SIGPLAN Notices (ACM Special Interest Group on Programming Languages)

Volumn 36, Issue 5, 2001, Pages 243-253

  Appel, Andrew W ^a   George, Lal ^b  

^a PRINCETON UNIVERSITY   (United States)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0012792835     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/381694.378854     Document Type: Article

References (18)

1. A. W. Appel. Modem Compiler Implementation in ML. Cambridge University Press, Cambridge, England, 1998.
2. A. W. Appel and D. B. MacQueen. Standard ML of New Jersey. In M. Wirsing, editor, 3rd International Symp. on Prog. Lang. Implementation and Logic Programming, pages 1-13, New York, Aug. 1991. Springer-Verlag.
3. P. Briggs. Register Allocation via Graph Coloring. PhD thesis, Rice University, April 1992.
4. P. Briggs, K. D. Cooper, and L. Torczon. Improvements to graph coloring register allocation. ACM Trans. on Programming Languages and Systems, 16(3):428-455, May 1994.
5. G. J. Chaitin, M. A. Auslander, A. K. Chandra, J. Cocke, M. E. Hopkins, and P. W. Markstein. Register allocation via coloring. Computer Languages, 6:47-57, January 1981.
6. F. C. Chow and J. L. Hennessy. The priority-based coloring approach to register allocation. ACM Trans. on Programming Languages and Systems, 12(4):501-536, October 1990.
7. CPLEX mixed integer solver, www.cplex.com, 2000.
8. R. Fourer, D. M. Gay, and B. W. Kernighan. AMPL: A Modeling Language for Mathematical Programming. Scientific Press, South San Francisco, CA, 1993. www.ampl.com.
9. L. George and A. W. Appel. Iterated register coalescing. In 23rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 208-218, New York, Jan 1996. ACM Press.
10. L. George, F. Guillame, and J. Reppy. A portable and optimizing back end for the SML/NJ compiler, volume 786 of LNCS, pages 83-97. Springer-Verlag, 1994.
11. D. W. Goodwin. Optimal and Near-Optimal Global Register Allocation. PhD thesis, University of California at Davis, 1996.
12. D. W. Goodwin and K. D. Wilken. Optimal and near-optimal global register allocation using 0-1 integer programming. Software - Practice and Experience, 26(8):929-965, 1996.
13. M. S. Hung. Optimization with IBM-OSL. Scientific Press, South San Francisco, CA, 1993.
14. A. B. Kempe. On the geographical problem of the four colors. American Journal of Mathematics, 2:193-200, 1879.
15. T. Kong and K. D. Wilken. Precise register allocation for irregular architectures. In 31st International Microarchitecture Conference. ACM, December 1998.
16. G. Lueh, T. Gross, and A. Adl-Tabatabai. Global register allocation based on graph fusion. In Languages and Compilers for Parallel Computing, pages 246-265. Springer Verlag, LNCS 1239, August 1997.
17. J. Park and S.-M. Moon. Optimistic register coalescing. In Proceedings of the 1998 International Conference on Parallel Architecture and Compilation Techniques, pages 196-204, 1998.
18. Y. Wu and J. R. Larus. Static branch frequency and program profile analysis. In 27th IEEE/ACM International Symposium on Microarchitecture (MICRO-27), Nov. 1994.