|
|
|
|
|
|
|
|
|
|
|
|
|
|
| • | by colouring
the interference graph |
||||||||||||
| • | No nodes in
interference graph joined by an |
||||||||||||
| edge may have
the same colour |
|||||||||||||
| • | Aim for
K-colouring with K m/c registers |
||||||||||||
| – | If there is no
K-colouring for the graph, we may |
||||||||||||
| have to spill
some values into memory |
|||||||||||||
| • | NP-complete
problem – but we have a linear |
||||||||||||
| time
approximation with four phases |
|||||||||||||
| – | Build, Simplify,
Spill, Select |
||||||||||||
