Register allocation

In the program optimization register allocation (English register allocation) refers to 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 retrieval can be reduced to the problem of graph coloring, which was shown in 1982 by Gregory Chaitin.