Deep Learning-based Hybrid Graph-Coloring Algorithm for Register Allocation

Understand

Register allocation, which is a crucial phase of a good optimizing compiler, relies on graph coloring.

• Hence, an efficient graph coloring algorithm is of paramount importance.
• In this work we try to learn a good heuristic for coloring interference graphs that are used in the register allocation phase.
• We aim to handle moderate sized interference graphs which have 100 nodes or less.