On the complexity of spill everywhere under SSA form

Proceedings of the ACM SIGPLAN Conference on Languages, Compilers, and Tools for Embedded Systems (LCTES)

Volumn , Issue , 2007, Pages 103-112

  Bouchez, Florent ^a   Darte, Alain ^a   Rastello, Fabrice ^a  

^a CNRS   (France)

Author keywords

Complexity; Register allocation; Spill; SSA form

Indexed keywords

ELECTRIC POWER UTILIZATION; HEURISTIC METHODS; POLYNOMIALS; PROGRAM PROCESSORS;

EMBEDDED COMPILATION; REGISTER ALLOCATION; SSA FORM;

EMBEDDED SYSTEMS;

EID: 34547982013     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1254766.1254782     Document Type: Conference Paper

References (23)

1. Andrew W. Appel and Lal George. Optimal spilling for CISC machines with, few registers. In ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI'01), pages 243-253, Snowbird, Utah, USA, June 2001. ACM Press.
2. L. A. Belady. A study of replacement algorithms for a virtual storage computer. IBM Systems Journal, 5(2):78-101, 1966.
3. C. Berge. Graphs and Hypergraphs. North Holland, 1973.
4. Florent Bouchez, Alain Darte, Christophe Guillon, and Fabrice Rastello. Register allocation and spill complexity under SSA. Technical Report. RR2005-33, LIP, ENS-Lyon, France, August. 2005.
5. Florent Bouchez, Alain Darte, Christophe Guillon, and Fabrice Rastello. Register allocation: What does the NP-completeness proof of Chaitin et al. really prove? In International Workshop on Languages and Compilers for Parallel Computing (LCPC'06), LNCS, New Orleans, Louisiana, 2006. Springer Verlag.
6. Philip Brisk, Foad Dabiri, Jamie Macbeth, and Majid Sarrafzadeh. Polynomial time graph coloring register allocation. In 14th International Workshop on Logic and Synthesis, June 2005.
7. Zoran Budimlić, Keith Cooper, Tim Harvey, Ken Kennedy, Tim Oberg, and Steve Reeves. Fast copy coalescing and live range identification. In ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI'02), pages 25-32, Berlin, Germany, 2002. ACM Press.
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:47-57, 1981.
9. Keith D. Cooper and Anshuman Dasgupta. Tailoring graph-coloring register allocation for runtime compilation. In International Symposium on Code Generation and Optimization (CGO'06), pages 39-49. IEEE Computer Society, 2006.
10. Keith D. Cooper and Linda Torczon. Engineering a Compiler. Morgan Kaufmann, 2004.
11. Martin Farach-Colton and Vincenzo Liberatore. On local register allocation. Journal of Algorithms, 37(1):37-65, 2000.
12. Michael R. Garey and Davis S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, 1979.
13. Martin Charles Golumbic. Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York, 1980.
14. Christian Grothoff, Rajkishore Barik, Rahul Gupta, and Vinayaka Pandit. Optimal bitwise register allocation using integer linear programming. In International Workshop on Languages and Compilers for Parallel Computing (LCPC'06), LNCS, New Orleans, Louisiana, 2006. Springer Verlag.
15. Sebastian Hack and Gerhard Goos. Optimal register allocation for SSA-form programs in polynomial time. Information Processing Letters, 98(4):150-155, May 2006.
16. Sebastian Hack, Daniel Grand, and Gerhard Goos. Towards register allocation for programs in SSA-form. Technical Report RR2005-27, Universität Karlsruhe, September 2005.
17. Sebastian Hack, Daniel Grand, and Gerhard Goos. Register allocation for programs in SSA-form. In International Conference on Compiler Construction (CC'06), volume 3923 of LNCS. Springer Verlag, 2006.
18. Guei-Yuan Lueh, Thomas Gross, and Ali-Reza Adl-Tabatabai. Fusion-based register allocation. ACM Transactions on Programming Languages and Systems, 22(3):431-470, 2000.
19. Poletto and Sarkar. Linear scan register allocation. ACM Transactions on Programming Languages and Systems, 21(5):895-913, 1999.
20. Omri Traub, Glenn H. Holloway, and Michael D. Smith. Quality and speed in linear-scan register allocation. In ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI'98), pages 142-151, 1998.
21. Christian Wimmer and Hanspeter Mössenböck. Optimized interval splitting in a linear scan register allocator. In Michael Hind and Jan Vitek, editors, 1st International Conference on Virtual Execution Environments (VEE'05), Chicago, IL, USA, June 2005. ACM.
22. Mihalis Yannakakis. Node-andedge-deletion NP-complete problems. In Annual ACM symposium on Theory of computing (STOC'78), pages 253-264, San Diego, CA, USA, 1978.
23. Mihalis Yannakakis and Fanica Gavril. The maximum k-colorable subgraph problem for chordal graphs. Information Processing Letters, 24(2):133-137, 1987.