Register allocation by optimal graph coloring
We here present new insights of properties of real-life interference graphs emerging in register allocation. These new insights imply good hopes for a possibility of improving the coloring approach towards optimal solutions. The conclusions axe based on measurements of nearly 28,000 real instances of such interference graphs. All the instances explored are determined to possess the so-called 1-per
