On the Complexity of Register Coalescing
@article{Bouchez2007OnTC, title={On the Complexity of Register Coalescing}, author={Florent Bouchez and A. Darte and F. Rastello}, journal={International Symposium on Code Generation and Optimization (CGO'07)}, year={2007}, pages={102-114} }
Memory transfers are becoming more important to optimize, for both performance and power consumption. With this goal in mind, new register allocation schemes are developed, which revisit not only the spilling problem but also the coalescing problem. Indeed, a more aggressive strategy to avoid load/store instructions may increase the constraints to suppress (coalesce) move instructions. This paper is devoted to the complexity of the coalescing phase, in particular in the light of recent… CONTINUE READING
Figures and Topics from this paper
48 Citations
Studying optimal spilling in the light of SSA
- Computer Science
- 2011 Proceedings of the 14th International Conference on Compilers, Architectures and Synthesis for Embedded Systems (CASES)
- 2011
- 10
Elimination of parallel copies using code motion on data dependence graphs
- Computer Science
- Comput. Lang. Syst. Struct.
- 2013
- 2
References
SHOWING 1-4 OF 4 REFERENCES
Optimistic register coalescing
- Computer Science
- Proceedings. 1998 International Conference on Parallel Architectures and Compilation Techniques (Cat. No.98EX192)
- 1998
- 43
- Highly Influential
Optimal spilling for CISC machines with few registers
- Computer Science
- PLDI '01
- 2001
- 153
- Highly Influential
- PDF
Register allocation for programs in SSA form
- Mathematics, Computer Science
- CC
- 2006
- 126
- Highly Influential
- PDF