Profile assisted register allocation

Proceedings of the ACM Symposium on Applied Computing

Volumn 2, Issue , 2000, Pages 774-781

  Kreahling, William C ^a   Norris, Cindy ^a  

^a APPALACHIAN STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALLOCATORS; PHYSICAL REGISTERS; PROFILING INFORMATIONS; REGISTER ALLOCATION; RUNTIMES; SPILL CODE;

COST ESTIMATING; LOADING;

COST BENEFIT ANALYSIS;

EID: 33750184306     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/338407.338562     Document Type: Conference Paper

References (14)

1. G. Ammons and J. R. Larus. Improving data-flow analysis with path profiles. In Proceedings of the ACM SIGPLAN'98 Conference on Programming Language Design and Implementation, pages 72-84, Montreal, Canada, 17-19 June 1998.
2. T. Ball and J. R. Larus. Optimally profiling and tracing programs. ACM Transactions on Programming Languages and Systems, 16(4):1319-1360, July 1994.
3. T. Ball and J. R. Larus. Efficient path profiling. In Proceedings of the 29th Annual International Symposium on Microarchitecture, pages 46-57, Paris, France, Dec. 2-4, 1996.
4. T. Ball, P. Mataga, and M. Sagiv. Edge profiling versus path profiling: The showdown. In Conference Record of POPL '98: The 25th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 134-148, San Diego, California, 19-21 Jan. 1998.
5. D. Bernstein, M. Golumbic, Y. Mansour, A. Pinter, D. Goldin, H. Krawcryk, and I. Nahshon. Spill code minimization techniques for optimizing compilers. In Proceedings of the SIGPLAN '89 Conference on Programming Language Design and Implementation, pages 258-263, Portland, OR, June 1989. ACM Press.
6. P. Briggs, K. D. Cooper, and L. Torczon. Improvements to graph coloring register allocation. ACM Transactions on Programming Languages and Systems (TOPLAS), 16(3):428-455, May 1994.
7. 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(1):47-57, 1981.
8. F. Chow and J. Hennessy. Register allocation by priority-based coloring. In Proceedings of the SIGPLAN '84 Symposium on Compiler Construction, pages 222-232. ACM, ACM, 1984.
9. L. George and A. W. Appel. Iterated register coalescing. ACM Transactions on Programming Languages and Systems, 18(3):300-324, May 1996.
10. J. L. Hennessy and D. A. Patterson. Computer Architecture: A Quantitative Approach. Morgan Kaufmann, San Mateo, CA, second edition, 1996.
11. D. Knuth and F. Stevenson. Optimal measurement points for program frequency counts. BIT, 13:313-322, 1973.
12. T. A. Proebsting and C. N. Ficher. Demand-driven register allocation. ACM Transactions on Programming Languages and Systems, 18(6):683-710, November 1996.
13. P. M. Sailer and D. R. Kaeli. The DLX Instruction Set Architecture Handbook. Morgan Kaufmann, San Fransisco, CA, 1996.
14. R. Sethi. Complete register allocation problems. In Conference Record of Fifth Annual ACM Symposium on Theory of Computing, pages 182-195, Austin, Texas, Apr. 1973.