TC-9 Goals

Things to learn during this stage that you should remember:

Use of work lists for efficiency

We maintain multiple work lists in sets to retain nodes in categories and avoid quadratic complexity in finding coalesceable nodes.

Register allocation as graph coloring

Graph coloring is an NP complete problem. In TC-9, we use a simple algorithm based on Kempe’s graph coloring algorithm.