|Register Allocation via Hiearachical Graph Coloring email@example.com (Sapna Jain) (2004-09-21)|
|Re: Register Allocation via Hiearachical Graph Coloring firstname.lastname@example.org (Richard F. Man) (2004-09-24)|
|Re: Register Allocation via Hiearachical Graph Coloring email@example.com (2004-09-24)|
|Re: Register Allocation via Hiearachical Graph Coloring firstname.lastname@example.org (2004-10-02)|
|From:||Sapna Jain <email@example.com>|
|Date:||21 Sep 2004 22:27:33 -0400|
|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.
Return to the
Search the comp.compilers archives again.