Loading...
Please wait, while we are loading the content...
Similar Documents
Dependence-Conscious Global Register Allocation (1994)
| Content Provider | CiteSeerX |
|---|---|
| Author | Ambrosch, Wolfgang Ertl, M. Anton Beer, Felix Krall, Andreas |
| Description | Register allocation and instruction scheduling are antagonistic optimizations: Whichever is applied first, it will impede the other. To solve this problem, we propose dependence-conscious colouring, a register allocation method that takes the dependence graph used by the instruction scheduler into consideration. Dependence-conscious colouring consists of two parts: First, the interference graph is built by analysing the dependence graphs, resulting in fewer interference edges and less spilling than the conventional preordering approach. Second, during colouring the register selection keeps dependence paths short, ensuring good scheduling. Dependence-conscious colouring reduces the number of interference edges by 7%--24% and antidependences by 46%--100%. |
| File Format | |
| Language | English |
| Publisher | Springer LNCS |
| Publisher Date | 1994-01-01 |
| Publisher Institution | IN PROCEEDINGS OF PLSA |
| Access Restriction | Open |
| Subject Keyword | Dependence-conscious Global Register Allocation Instruction Scheduler Instruction Scheduling Register Allocation Antagonistic Optimization Dependence-conscious Colouring Register Allocation Method Conventional Preordering Approach Interference Edge Good Scheduling Interference Graph Register Selection Dependence Graph Dependence Path |
| Content Type | Text |
| Resource Type | Article |
