Displaying 2 results from an estimated 2 matches for "metaheuristics".
2017 Dec 15
0
Register Allocation Graph Coloring algorithm and Others
...g building conflict graphs and its cost in RAs.
> And I am practicing[4] to use HEA, developed by Dr. Rhydian Lewis, for
> LLVM firstly.
>
When I just started to work on RAs very long ago I used about the same
approach: a lot of tiny transformations directed by a cost function and
using metaheuristics (I also used tabu search as HEA). Nothing good came
out of this.
If you are interesting in RA algorithms and architectures, I'd recommend
Michael Matz article
ftp://gcc.gnu.org/pub/gcc/summit/2003/Graph%20Coloring%20Register%20Allocation.pdf
as a start point.
>
> [1] https://reviews....
2017 Dec 15
8
Register Allocation Graph Coloring algorithm and Others
Hi GCC and LLVM developers,
I am learning Register Allocation algorithms and I am clear that:
* Unlimited VirtReg (pseudo) -> limited or fixed or alias[1] PhysReg (hard)
* Memory (20 - 100 cycles) is expensive than Register (1 cycle), but it
has to spill code when PhysReg is unavailable
* Folding spill code into instructions, handling register coallescing,
splitting live ranges, doing