Register Spilling and Live-Range Splitting for SSA-Form Programs
Open Access
- 1 January 2009
- book chapter
- Published by Springer Nature
- p. 174-189
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Extended Linear Scan: An Alternate Foundation for Global Register Allocation2007
- A short proof of optimality for the MIN cache replacement algorithmInformation Processing Letters, 2007
- Register Allocation: What Does the NP-Completeness Proof of Chaitin et al. Really Prove? Or Revisiting Register Allocation: Why and HowLecture Notes in Computer Science, 2007
- Register Allocation for Programs in SSA-Form2006
- The Power of Belady’s Algorithm in Register Allocation for Long Basic Blocks2004
- Translating Out of Static Single Assignment Form1999
- Linear scan register allocationACM Transactions on Programming Languages and Systems, 1999
- A new algorithm for scalar register promotion based on SSA form1998
- Probabilistic register allocationACM SIGPLAN Notices, 1992
- Efficiently computing static single assignment form and the control dependence graphACM Transactions on Programming Languages and Systems, 1991