On Local Register Allocation

Journal of Algorithms

Volumn 37, Issue 1, 2000, Pages 37-65

  Farach Colton, Martin ^a   Liberatore, Vincenzo ^b  

^a RUTGERS UNIVERSITY   (United States)

^b UNIVERSITY OF MARYLAND   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0346739888     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.2000.1095     Document Type: Article

References (35)

1. A. V. Aho, R. Sethi, and J. D. Ullman, "Compilers: Principles, Techniques, and Tools," Addison-Wesley, Reading, MA, 1986.
2. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, "Network Flows," Prentice-Hall, Englewood Cliffs, NJ, 1993.
3. J. Backus, The history of FORTRAN I, II, and III, in "History of Programming Language" (R. Wexelblat, Ed.) ACM Monographs, pp. 25-45, Assoc. Comput. Mach., New York, 1981.
4. J. W. Backus, R. J. Beeber, S. Best, R. Goldberg, L. M. Haibt, H. L. Heerick, R. A. Nelson, D. Sayre, P. B. Sheridan, H. Stern, I. Ziller, R. A. Hughes, and R. Nutt, The Fortran automatic coding system, in "Western Joint Computer Conference," pp. 188-198, 1957.
5. J. C. Beatty, Register assignment algorithm for generation of highly optimized code, IBM J. Res. Develop. 18 (1974), 20-39.
6. L. A. Belady, A study of replacement algorithms for a virtual storage computer, IBM Systems J. 5 (1966), 78-101.
7. P. Briggs, K. D. Cooper, and L. Torczon, Improvements to graph coloring register allocation, ACM Trans. Progr. Languages Systems 16 (1994), 428-455.
8. D. Callahan and B. Koblenz, Register allocation via hierarchical graph coloring, in "Proceedings of the ACM SIGPLAN '91 Conference on Programming Languages Design and Implementation," pp. 192-203, June 1991.
9. M. C. Carlisle, "On Local Register Allocation," Honors Thesis, University of Delaware, 1991.
10. R. W. Carr, "Virtual Memory Management," Computer Science: Systems Programming, Vol. 20, UMI Research Press, Ann Arbor, MI, 1984.
11. M. Chrobak, H. Karloff, T. Payne, and S. Vishwanathan, New results on server problems, SIAM J. Discrete Math. 4 (1991), 172-181.
12. A. Fiat and Z. Rosen, Experimental studies of access graph based heuristics: Beating the LRU standard? in "Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms," pp. 63-73, 1997.
13. C. N. Fischer and R. J. LeBlanc, Jr., "Crafting a Compiler," Benjamin-Cummings, Menlo Park, CA, 1988.
14. J. A. Fisher, Very long instruction word architectures and ELI-512, in "Proc. Tenth Symposium on Computer Architecture," pp. 140-150, June 1983.
15. C. W. Fraser and D. R. Hanson, Simple register spilling in a retargetable compiler, Software 22 (1992), 85-99.
16. L. J. Hendren, G. R. Gao, E. R. Altman, and C. Mukerji, A Register Allocation Framework Based on Hierarchical Cyclic Interval Graphs, ACAPS Technical Memo 33, McGill University, February 1993.
17. J. L. Hennessy and D. A. Patterson, "Computer Architecture: A Quantitative Approach," second ed., Morgan Kaufmann, San Mateo, CA, 1996.
18. L. P. Horwitz, R. M. Karp, R. E. Miller, and S. Winograd, Index register allocation, J. Assoc. Comput. Mach. 13 (1966), 43-61.
19. W.-C. Hsu, C. N. Fischer, and J. R. Goodman, On the minimization of load/stores in local register allocation, IEEE Trans. Software Eng. 15 (1989), 1252-1260.
20. S. Irani, A. R. Karlin, and S. Phillips, Strongly competitive algorithms for paging with locality of reference, SIAM J. Comput. 25 (1996), 477-497.
21. K. Kennedy, Index register allocation in straight line code and simple loops, in "Design and Optimization of Compilers" (R. Rustin, Ed.), pp. 51-63, Prentice-Hall, Englewood Cliffs, NJ, 1972.
22. D. Kranz et al. ORBIT: An optimizing compiler for scheme, in "Proceedings of the ACM SIGPLAN '86 Conference on Programming Languages Design and Implementation," 1986.
23. V. Liberatore, M. Farach-Colton, and U. Kremer, Evaluation of algorithms for local register allocation, in "Compiler Construction (CC'99)" (S. Jähnichen, Ed.), Lecture Notes in Computer Science, Vol. 1575, pp. 137-152, 1999.
24. M. S. Manasse, L. A. McGeoch, and D. D. Sleator, Competitive algorithms for server problems, J. Algorithms 11 (1990), 208-230.
25. L. A. McGeoch and D. D. Sleator, A strongly competitive randomized paging algorithm, Algorithmica 6 (1991), 816-825.
26. W. G. Morris, CCG: A prototype coagulating code generator, in "Proceedings of the ACM SIGPLAN '91 Conference on Programming Languages Design and Implementation," pp. 45-58, June 1991.
27. I. Nakata, On compiling algorithms for arithmetic expressions, Commun. ACM 10 (1967), 492-494.
28. T. A. Proebsting and C. N. Fischer, Demand-driven register allocation, ACM Trans. Progr. Languages System 18 (1996), 683-710.
29. A. Silberschatz and J. L. Peterson, "Operating Systems Concepts," Addison-Wesley, Reading, MA, 1983.
30. D. D. Sleator and R. E. Tarjan, Amortized efficiency of list update and paging rules, Comm. Assoc. Comput. Mach. 28 (1985), 202-208.
31. A. S. Tanenbaum, "Modern Operating Systems," Prentice-Hall, Englewood Cliffs, NJ, 1992.
32. M. Thorup, On RAM priority queues, in "Proc. Seventh ACM-SIAM Symposium on Discrete Algorithms," pp. 59-67, 1996.
33. J.-P. Tremblay and P. G. Sorenson, "The Theory and Practice of Compiler Writing," McGraw-Hill, New York, 1985.
34. A. F. Veinott, Jr. and H. M. Wagner, Optimal capacity scheduling - I. Oper. Res. 10 (1962), 518-532.
35. N. Young, The K-server dual and loose competitiveness for paging, Algorithmica 11 (1994), 525-541.