Re: Pitfalls in interference graph ?

> > I am trying to implement Briggs Optimistic register allocator after
> > reading the the thesis written by Preston Briggs.
>
> > Now for building the interference graph what other than register pairs
> > is there any other issues that one has to look out for?
>
> This a pretty old method of register allocation that do no longer work
> well. Indeed, it was designed for the case of sequential processors.
> Nowadays, processors implement instruction level parallelism. The
> register allocation problem changed, and the old graph coloring
> methods became useless.


Huh? Where is the dependence on sequential processing in graph
coloring allocation? Moreover, only a few non mainstream archs expose
non sequential semantics at the ISA level anyway.

Return to the comp.compilers page.
Search the comp.compilers archives again.