Live range splitting in a graph coloring register allocator

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

Volumn 1383, Issue , 1998, Pages 174-187

  Cooper, Keith D ^a   Taylor Simpson, L ^b  

^a RICE UNIVERSITY   (United States)

^b Trilogy Development Group   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); GRAPH THEORY; PROGRAM COMPILERS;

ESTIMATED COSTS; EXPERIMENTAL EVIDENCE; GLOBAL APPROACHES; GRAPH COLORINGS; INTERFERENCE GRAPHS; NON-TRIVIAL; REGISTER ALLOCATION; TARGET MACHINES;

COLORING;

EID: 84958033885     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0026430     Document Type: Conference Paper

References (14)

1. Peter Bergner, Peter Dahl, David Engebretsen, and Matthew O'Keefe. Spill code minimization via interference region spilfing. SIGPLAN Notices, 32(6):287-295, June 1997. Proceedings of the ACM SIGPLAN '97 Conferenee on Programming Language Design and Implementation.
2. David Bernstein, Dina Q. Goldin, Martin C. Golumbic, Hugo Krawczyk, Yishay Mansour, Itai Nahshon, and Ron Y. Pinter. Spill code minimization techniques for optimizing compilers. SIGPLAN Notices, 24(7):258-263, July 1989. Proceedings of the ACM SIGPLAN '89 Conference on Programming Language Design and Implementation.
3. Preston Briggs. Register Allocation via Graph Coloring. PhD thesis, Rice University, April 1992.
4. Preston Briggs, Keith D. Cooper, Ken Kennedy, and Linda Torczon. Coloring heuristics for register allocation. SIGPLAN Notices, 24(7):275-284, July 1989. Proceedings of the A CM SIGPLAN '89 Conference on Programming Language Design and Implementation.
5. Preston Briggs, Keith D. Cooper, and Linda Torczon. Rematerialization. StGPLAN Notices, 27(7):311-321, July 1992. Proceedings of the A CM SIGPLAN '92 Conference on Programming Language Design and Implementation.
6. Steve Carr Memory-Hierarchy Management. PhD thesis, Rice University, Department of Computer Science, September 1992.
7. Gregory J. Chaitin. Register allocation and spilling via graph coloring. SIGPLAN Notices, 17(6):98-105, June 1982. Proceedings of the ACM SIGPLAN '82 Symposium on Compiler Construction.
8. Gregory J. Chaitin, Marc A. Auslander, Ashok K. Chandra, John Cocke, Martin E. Hopkins, and Peter W. Markstein. Register allocation via coloring. Computer Languages, 6(1):47-57, January 1981.
9. Fred C. Chow and John L. Hennessy. Register allocation by priority-based coloring. SIGPLAN Notices, 19(6):222-232, June 1984. Proceedings of the ACM SIGPLAN '84 Symposium on Compiler Construction.
10. Keith D. Cooper, Mary W. Hall, and Linda Torczon. An experiment with inline substitution. Software - Practice and Experience, 21(6):581-601, June 1991.
11. Keith D. Cooper, Timothy J. Harvey, and Linda Torczon. How to build an interference graph. Software-Practice and Experience (to appear), 1998. Available on the web at http://softlib.rice.edu/MSCP/publications.html.
12. Ron Cytron, Jeanne Ferrante, Barry K. Rosen, Mark N. Wegman, and F. Kenneth Zadeck. An efficient method of computing static single assignment form. In Conference Record of the Sixteenth Annual A CM Symposium on Principles of Programming Languages, pages 25-35, Austin, Texas, January 1989.
13. Janet Fabri. Automatic storage optimization. SIGPLAN Notices, 14(8):83-91, August 1979.Proceedings of the ACM SIGPLAN '79 Symposium on Compiler Construction.
14. Todd C. Mowry, Monica S. Lam, and Anoop Gupta. Design and evaluation of a compiler algorithm for prefetching. SIGPLAN Notices, 27(9):62-75, September 1992. In Proceedings of the Fifth International Conference on Architectural Support for Programming Languages and Operating Systems.