View source for REGISTER ALLOCATION HEURISTICS ORDER: abstract simplified (17717941)

*This abstract for appeared for patent application  number 17717941 Titled 'REGISTER ALLOCATION HEURISTICS ORDER'

==Simplified Explanation==

The abstract discusses how the process of compilation can be improved by changing the order in which certain steps are performed. This order can be determined based on various factors, such as the target processor architecture, operating system, type of source code, and optimization goals. A genetic algorithm is used to efficiently generate and evaluate different orders of steps until the best one is found. The evaluation is based on either real or simulated performance.


==Original Abstract Submitted==

Compilation is supported and improved by varying the order of invocation of register allocation heuristics during code generation. A particular invocation order may be chosen based on one or more compilation scenario properties, such as a target processor architecture, a target operating system, a kind of source code being compiled, or optimization targets for the compiler or the generated code, or a mix thereof. Suitable heuristics invocation orders may be produced efficiently and effectively using a genetic algorithm that is adapted to make a population of invocation orders, select parents, create offspring, and assess invocation order fitness, until the population converges on optimal orders. Invocation order fitness assessments may be based on actual performance or simulated performance.