Register Allocation by Graph Coloring
An undirected graph is colored by assigning a ``color'' to each node, such that no two nodes that are connected have the same color.
Graph coloring is applied to register assignment in the following way:
By keeping as many variables as possible in registers, the code can be significantly improved.
Contents    Page-10    Prev    Next    Page+10    Index