DMCA
SSA-based register allocation with PBQP (2011)
| Venue: | Compiler Construction, volume 6601 of Lecture Notes in Computer Science, chapter 4 |
| Citations: | 4 - 0 self |
BibTeX
@INPROCEEDINGS{Buchwald11ssa-basedregister,
author = {Sebastian Buchwald and Andreas Zwinkau and Thomas Bersch},
title = {SSA-based register allocation with PBQP},
booktitle = {Compiler Construction, volume 6601 of Lecture Notes in Computer Science, chapter 4},
year = {2011},
pages = {42--61},
publisher = {Springer}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Abstract. Recent research shows that maintaining SSA form allows to split register allocation into separate phases: spilling, register assign-ment and copy coalescing. After spilling, register assignment can be done in polynomial time, but copy coalescing is NP-complete. In this pa-per we present an assignment approach with integrated copy coalescing, which maps the problem to the Partitioned Boolean Quadratic Problem (PBQP). Compared to the state-of-the-art recoloring approach, this re-duces the relative number of swap and copy instructions for the SPEC CINT2000 benchmark to 99.6 % and 95.2%, respectively, while taking 19 % less time for assignment and coalescing.
