Register allocation & spilling via graph coloring

@inproceedings{Chaitin1982RegisterA,
  title={Register allocation & spilling via graph coloring},
  author={G. Chaitin},
  booktitle={SIGPLAN '82},
  year={1982}
}
  • G. Chaitin
  • Published in SIGPLAN '82 1982
  • Computer Science
  • In a previous paper we reported the successful use of graph coloring techniques for doing global register allocation in an experimental PL/I optimizing compiler. When the compiler cannot color the register conflict graph with a number of colors equal to the number of available machine registers, it must add code to spill and reload registers to and from storage. Previously the compiler produced spill code whose quality sometimes left much to be desired, and the ad hoe techniques used took… CONTINUE READING

    Topics from this paper.

    Register allocation via graph coloring
    • 209
    The priority-based coloring approach to register allocation
    • 324
    • PDF
    Register allocation by priority-based coloring
    • 240
    • PDF
    Iterated register coalescing
    • 139
    All Structured Programs have Small Tree-Width and Good Register Allocation
    • 164
    Spill code minimization via interference region spilling
    • 84
    Software prefetching
    • 493
    • PDF