Register allocation by puzzle solving

Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)

Volumn , Issue , 2008, Pages 216-226

  Pereira, Fernando Magno Quintão ^a   Palsberg, Jens ^a  

^a Department of Civil and Environmental Engineering   (United States)

Author keywords

Puzzle solving; Register aliasing; Register allocation

Indexed keywords

ALIASING; EXTENDED VERSIONS; JIT COMPILERS; LINEAR SCANS; POLYNOMIAL TIMES; POWERPC; PROGRAM VARIABLES; PUZZLE SOLVING; REGISTER ALIASING; REGISTER ALLOCATION; REGISTER ALLOCATIONS; REGISTER FILES; SPEC CPU2000; STRONGARM;

C (PROGRAMMING LANGUAGE); CODES (SYMBOLS); COMPUTER SOFTWARE; COMPUTERS; FLOCCULATION; LINGUISTICS; POLYNOMIAL APPROXIMATION;

COMPUTER PROGRAMMING LANGUAGES;

EID: 57349119907     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1375581.1375609     Document Type: Conference Paper

References (41)

1. Scott Ananian. The static single information form. Master's thesis, MIT, September 1999.
2. Andrew W. Appel and Lai George. Optimal spilling for CISC machines with few registers. In PLDI, pages 243-253. ACM Press, 2001.
3. L. Belady. A study of the replacement of algorithms of a virtual storage computer. IBM System Journal, 5:78-101, 1966.
4. M Biró, M Hujter, and Zs Tuza. Precoloring extension. I:Iinterval graphs. In Discrete Mathematics, pages 267- 279. ACM Press, 1992.
5. Rastislav Bodik, Rajiv Gupta, and Vivek Sarkar. ABCD: eliminating array bounds checks on demand. In PLDI, pages 321-333. ACM Press, 2000.
6. Florent Bouchez. Allocation de registres et vidage en mémoire. Master's thesis, ENS Lyon, 2005.
7. Florent Bouchez, Alain Darte, Christophe Guillon, and Fabrice Rastello. Register allocation: What does the NP-completeness proof of chaitin et al. really prove? Or revisiting register allocation: Why and how. In LCPC, pages 283-298. Springer, 2006.
8. Preston Briggs, Keith D. Cooper, Timothy J. Harvey, and L. Taylor Simpson. Practical improvements to the construction and destruction of static single assignment form. SPE, 28(8):859-881, 1998.
9. Philip Brisk, Foad Dabiri, Jamie Macbeth, and Majid Sarrafzadeh. Polynomial-time graph coloring register allocation. In IWLS, pages 447-454. 2005.
10. Philip Brisk and Majid Sarrafzadeh. Interference graphs for procedures in static single information form are interval graphs. In SCOPES, pages 101-110. ACM Press, 2007.
11. Zoran Budimlic, Keith D. Cooper, Timothy J. Harvey, Ken Kennedy, Timothy S. Oberg, and Steven W. Reeves. Fast copy coalescing and live-range identification. In PLDI, pages 25-32. ACM Press, 2002.
12. Gregory J. Chaitin, Mark A. Auslander, Ashok K. Chandra, John Cocke, Martin E. Hopkins, and Peter W. Markstein. Register allocation via coloring. Computer Languages, 6:47-57, 1981.
13. Ron Cytron, Jeanne Ferrante, Barry K. Rosen, Mark N. Wegman, and F. Kenneth Zadeck. Efficiently computing static single assignment form and the control dependence graph. TOPLAS, 13(4):451-490, 1991.
14. Alkis Evlogimenos. Improvements to linear scan register allocation. Technical report, University of Illinois, Urbana-Champaign, 2004.
15. Martin Farach and Vincenzo Liberatore. On local register allocation. In SODA, pages 564-573. ACM Press, 1998.
16. Fanica Gavril. The intersection graphs of subtrees of a tree are exactly the chordal graphs. Journal of Combinatorial Theory, Series B, 16(1):47-56, 1974.
17. Lai George and Andrew W. Appel. Iterated register coalescing. TOPLAS, 18(3):300-324, 1996.
18. Martin Charles Golumbic. Trivially perfect graphs. Discrete Mathematics, 24:105-107, 1978.
19. Daniel Grand and Sebastian Hack. A fast cutting-plane algorithm for optimal coalescing. In CC, volume 4420, pages 111-115. Springer, 2007.
20. Sebastian Hack, Daniel Grund, and Gerhard Goos. Register allocation for programs in SSA-form. In CC, pages 247-262. Springer, 2006.
21. Lang Hames and Bernhard Scholz. Nearly optimal register allocation with PBQP. In JMLC, pages 346-361. Springer, 2006.
22. Corporate SPARC International Inc. The SPARC Architecture Manual, Version 8. Prentice Hall, 1st edition, 1992.
23. Richard Johnson and Keshav Pingali. Dependence-based program analysis. In PLDI, pages 78-89. ACM Press, 1993.
24. Richard M Karp. Reducibility among combinatorial problems. In Complexity of Computer Computations, pages 85-103. Plenum, 1972.
25. David Ryan Koes and Seth Copen Goldstein. A global progressive register allocator. In PLDI, pages 204-215. ACM Press, 2006.
26. Chris Lattner and Vikram Adve. LLVM: A compilation framework for lifelong program analysis & transformation. In CGO, pages 75-88. IEEE, 2004.
27. Jonathan K. Lee, Jens Palsberg, and Fernando M. Q. Pereira. Aliased register allocation for straight-line programs is NP-complete. In ICALP, pages 680-691. Springer, 2007.
28. Daniel Marx. Precoloring extension on unit interval graphs. Discrete Applied Mathematics, 154(6):995-1002, 2006.
29. Clyde L. Monma and V. K. Wei. Intersection graphs of paths in a tree. Journal of Combinatorial Theory, Series B, 41 (2): 141 -181, 1986.
30. Fernando Magno Quintao Pereira and Jens Palsberg. Register allocation via coloring of chordal graphs. In APLAS, pages 315-329. Springer, 2005.
31. Fernando Magno Quintao Pereira and Jens Palsberg. Register allocation after classic SSA elimination is NP-complete. In FOSSACS, pages 79-93. Springer, 2006.
32. Fernando Magno Quintao Pereira and Jens Palsberg. Register allocation by puzzle solving, 2008. http://compilers.cs.ucla.edu/ fernando/projects/puzzles/.
33. Massimiliano Poletto and Vivek Sarkar. Linear scan register allocation. TOPLAS, 21(5):895-913, 1999.
34. Vivek Sarkar and Rajkishore Barik. Extended linear scan: an alternate foundation for global register allocation. In CC, pages 141-155. Springer, 2007.
35. Bemhard Scholz and Erik Eckstein. Register allocation for irregular architectures. SIGPLAN Notices, 37(7): 139-148, 2002.
36. Michael D. Smith, Norman Ramsey, and Glenn Holloway. A generalized algorithm for graph-coloring register allocation. In PLDI, pages 277-288. ACM Press, 2004.
37. Vugranam C. Sreedhar, Roy Dz ching Ju, David M. Gillies, and Vatsa Santhanam. Translating out of static single assignment form. In SAS, pages 194-210. Springer, 1999.
38. Omri Traub, Glenn H. Holloway, and Michael D. Smith. Quality and speed in linear-scan register allocation. In PLDI, pages 142-151. ACM Press, 1998.
39. David L. Weaver and Tom Germond. The SPARC Architecture Manual, Version 9. Prentice Hall, 1 st edition, 1994.
40. Christian Wimmer and Hanspeter Mossenbock. Optimized interval splitting in a linear scan register allocator. In VEE, pages 132-141. ACM Press, 2005.
41. Mihalis Yannakakis and Fanica Gavril. The maximum k-colorable subgraph problem for chordal graphs. Information Processing Letters, 24(2): 133-137, 1987.