Evaluation of algorithms for local register allocation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1575, Issue , 1999, Pages 137-153

  Liberatore, Vincenzo ^a   Farach Colton, Martin ^b   Kremer, Ulrich ^b  

^a UNIVERSITY OF MARYLAND   (United States)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INTEGER PROGRAMMING; PROGRAM COMPILERS;

BENCHMARK PROGRAMS; INSTRUCTION SCHEDULING; INSTRUCTION STREAMS; INTEGER LINEAR PROGRAMMING; QUALITY ASSESSMENT; REGISTER ALLOCATION; REGISTER ASSIGNMENT; SPECULATIVE EXECUTION;

C (PROGRAMMING LANGUAGE);

EID: 84949191729     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-49051-7_10     Document Type: Conference Paper

References (21)

1. A. V. Aho, R. Sethi, and J. D. Ullman. Compilers: Principles, Techniques, and Tools. Addison-Wesley, Reading, MA, 1986.
2. J. Backus. The history of FORTRAN I, II, and III. In Richard Wexelblat, editor, History of Programming Languages, ACM Monographs Series, pages 25–45. Academic Press, New York, 1981.
3. J. C. Beatty. Register assignment algorithm for generation of highly optimized code. IBM J. Res. Develop., 18:20–39, January 1974.
4. L. A. Belady. A study of replacement algorithms for a virtual storage computer. IBM Systems Journal, 5(2):78–101, 1966.
5. P. Briggs, K. Cooper, and L. Torczon. Improvements to graph coloring register allocation. ACM Trans. on Programming Lang. and Sys., 16(3):428–455, May 1994.
6. G. J. Chaitin. Register allocation & spilling via graph coloring. In Proceedings of the ACM SIGPLAN Symposium on Compiler Construction, pages 98–105, 1982.
7. M. Farach and V. Liberatore. On local register allocation. In Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 564–573, 1998.
8. C. N. Fischer and R. J. LeBlanc Jr. Crafting a Compiler. Benjamin/Cummings, Menlo Park, CA, 1988.
9. M. R. Garey and D. S. Johnson. Computers and Intractability. A Guide to the Theory of NP-Completeness. Freeman, San Francisco, 1979.
10. M. Held and R. Karp. The traveling salesman problem and minimum spanning trees. Operations Research, 18:1138–1162, 1970.
11. D. S. Hochbaum, editor. Approximation Algorithms for NP-hard Problems. PWS Publishing Company, Boston, 1997.
12. L. P. Horwitz, R. M. Karp, R. E. Miller, and S. Winograd. Index register allocation. Journal of the Association for Computing Machinery, 13(1):43–61, January 1966.
13. W-C. Hsu, C. N. Fischer, and J. R. Goodman. On the minimization of load/stores in local register allocation. IEEE Transactions on Software Engineering, 15(10):1252–1260, October 1989.
14. K. Kennedy. Index register allocation in straight line code and simple loops. In Randall Rustin, editor, Design and Optimization of Compilers, pages 51–63. Prentice-Hall, Englewood Cliffs, NJ, 1972.
15. U. Kremer. Optimal and near-optimal solutions for hard compilation problems. Parallel Processing Letters, 7(2):371–378, 1997.
16. S. M. Kurlander and C. N. Fischer. Minimum cost interprocedural register allocation. In Proceedings of the 23rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1996.
17. V. Liberatore. Uniform multipaging reduces to paging. Information Processing Letters, 67:9–12, 1998.
18. V. Liberatore, M. Farach-Colton, and U. Kremer. Evaluation of algorithms for local register allocation. Technical Report TR98-376, Laboratory for Computer Science Research, Rutgers University, 1998.
19. F. Luccio. A comment on index register allocation. Communications of the ACM, 10(9):572–574, September 1967.
20. T. A. Proebsting and C. N. Fischer. Demand-driven register allocation. ACM Trans. on Programming Lang. and Sys., 18(6):683–710, November 1996.
21. J. Ruttenberg, G. R. Gao, A. Stoutchinin, and W. Lichtenstein. Software pipelining showdown: Optimal vs. heuristics methods in production compilers. In Proc. SIGPLAN‘96 Conf. on Programming Language Design and Implementation, pages 1–11, May 1996.