Retargetable Graph-Coloring Register Allocation for Irregular Architectures
| Autor: | Sven-Olof Nyström, Johan Runeson |
|---|---|
| Rok vydání: | 2003 |
| Předmět: |
Theoretical computer science
Processor register Computer science Parameterized complexity Optimizing compiler Parallel computing computer.software_genre Runtime system Register (music) Compiler Graph coloring Hardware_CONTROLSTRUCTURESANDMICROPROGRAMMING Hardware_REGISTER-TRANSFER-LEVELIMPLEMENTATION computer Register allocation |
| Zdroj: | Software and Compilers for Embedded Systems ISBN: 9783540201458 SCOPES |
| DOI: | 10.1007/978-3-540-39920-9_17 |
| Popis: | Global register allocation is one of the most important optimizations in a compiler. Since the early 80’s, register allocation by graph coloring has been the dominant approach. The traditional formulation of graph-coloring register allocation implicitly assumes a single bank of non-overlapping general-purpose registers and does not handle irregular architectural features like overlapping register pairs, special purpose registers, and multiple register banks. We present a generalization of graph-coloring register allocation that can handle all such irregularities. The algorithm is parameterized on a formal target description, allowing fully automatic retargeting. We report on experiments conducted with a prototype implementation in a framework based on a commercial compiler. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|