Graph coloring register allocation via iterative scan

avayvod@gmail.com
3 Feb 2006 18:36:59 -0500

          From comp.compilers

Related articles
Graph coloring register allocation via iterative scan avayvod@gmail.com (2006-02-03)
Re: Graph coloring register allocation via iterative scan robert.thorpe@antenova.com (Rob Thorpe) (2006-02-06)
Re: Graph coloring register allocation via iterative scan vmakarov@redhat.com (Vladimir Makarov) (2006-02-07)
Re: Graph coloring register allocation via iterative scan avayvod@gmail.com (Whywhat) (2006-02-11)
Re: Graph coloring register allocation via iterative scan vmakarov@redhat.com (Vladimir Makarov) (2006-02-14)
Re: Graph coloring register allocation via iterative scan sylerugby@yahoo.com (2006-02-17)
Re: Graph coloring register allocation via iterative scan Sid.Touati@inria.fr (Sid Touati) (2006-02-20)
[2 later articles]
| List of all articles for this month |

From: avayvod@gmail.com
Newsgroups: comp.theory,comp.compilers,comp.programming
Date: 3 Feb 2006 18:36:59 -0500
Organization: http://groups.google.com
Keywords: registers, question

Hello!


I wonder whether register allocation via graph coloring (improved by
Preston Briggs) is commonly better than iterative scan algortihm
(introduced by Alkis Evlogimenos). In what cases one is better than
the other? Are there some theoretical proofs of dominance of one of
the methods?


By being better I mean producing more efficient code with less register
spills.


Any information would be appreciated. Thank you.


Post a followup to this message

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