Forums before death by AOL, social media and spammers... "We can't have nice things"
|    comp.compilers    |    Compiler construction, theory, etc. (Mod    |    2,753 messages    |
[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]
|    Message 1,088 of 2,753    |
|    ST to All    |
|    Re: Pitfalls in interference graph ?    |
|    01 Oct 07 11:10:17    |
      From: SidTouati@inria.fr              Mohamed Shafi a icrit :       > 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.              Regards       S.T.              --- SoupGate-Win32 v1.05        * Origin: you cannot sedate... all the things you hate (1:229/2)    |
[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]
(c) 1994, bbs@darkrealms.ca