Register Allocation via Hiearachical Graph Coloring

Sapna Jain <sapna@cse.iitb.ac.in>
21 Sep 2004 22:27:33 -0400

          From comp.compilers
Related articles
Register Allocation via Hiearachical Graph Coloring sapna@cse.iitb.ac.in (Sapna Jain) (2004-09-21)
Re: Register Allocation via Hiearachical Graph Coloring richard@imagecraft.com (Richard F. Man) (2004-09-24)
Re: Register Allocation via Hiearachical Graph Coloring jle@ural.owlnet.rice.edu (2004-09-24)
Re: Register Allocation via Hiearachical Graph Coloring koes@cmu.edu (2004-10-02)
| List of all articles for this month |
From: Sapna Jain <sapna@cse.iitb.ac.in>
Newsgroups: comp.compilers
Date: 21 Sep 2004 22:27:33 -0400
Organization: Compilers Central
Keywords: registers, question
Posted-Date: 21 Sep 2004 22:27:33 EDT

I have read David Callahan & Brian Koblenz's paper of "Register
Allacation via hierarchical Graph Coloring, & find that it works
better in all condition than Chaitin's & Brigg's method.


Do you know any compiler which uses that technique, or have u worked
on any compiler using the technique.


And if U may tell me some pitfalls of the technique, and some other
register allocation method better than it, also the condition in which
that method will be better.


Thanks,
Sapna


Post a followup to this message

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