Register allocation

from Wikipedia, the free encyclopedia

In the program optimization designating register allocation (Engl. Register Allocation ) the process of allocating a large number of program variables to a small number of registers in the main processor .

The NP-complete problem of register allocation and swapping can be reduced to the problem of graph coloring , which was shown by Gregory Chaitin in 1982 .

See also

swell

  1. ↑ Fernando Magno Quintão Pereira, Jens Palsberg, Register Allocation after Classical SSA Elimination is NP-complete (pdf; 493 kB)
  2. ↑ Gregory J. Chaitin, Mark A. Auslander, Ashok K. Chandra, John Cocke , Martin E. Hopkins, and Peter W. Markstein. Register allocation via coloring. Computer Languages, 6: 47-57, 1981