|Reg. Alloc. - Graph Coloring firstname.lastname@example.org (1990-10-18)|
|Re: Reg. Alloc. - Graph Coloring email@example.com (1990-10-18)|
|Re: Reg. Alloc. - Graph Coloring firstname.lastname@example.org (1990-10-19)|
|Re: Reg. Alloc. - Graph Coloring email@example.com (1990-10-23)|
|Re: Reg. Alloc. - Graph Coloring firstname.lastname@example.org (1990-10-25)|
|Re: Reg. Alloc. - Graph Coloring email@example.com (1990-10-26)|
|Re: Reg. Alloc. - Graph Coloring firstname.lastname@example.org (1990-11-02)|
|From:||email@example.com (Preston Briggs)|
|Organization:||Rice University, Houston|
|Date:||Thu, 18 Oct 90 20:06:46 GMT|
In article <9010181425.AA15324@cs.clemson.edu> firstname.lastname@example.org writes:
>Are there any register allocation techniques that do not use some variation
>of graph coloring ?
Sure. There's a zillion ideas that work ok for allocation in a basic block.
The Dragon Book is a good source, especially the bibliography. Allocation
across many basic blocks is more difficult, interesting, and profitable.
TN-Binding was developed at CMU as part of the PQCC project and was
apparently used in several projects. The best description is in Bruce
Leverett's thesis, called (approximately) Register Allocation in an
Optimizing Compiler. Check the library.
IBM had lots of ideas. I don't know how many have been widely published.
Names like Beatty and Harbison (Harrison?) come to mind. Other work was
done by Tan.
Coloring is attractive in that it offers a nice abstraction, protecting you
from a lot of the grundgy details of the job. Further, it offers a nice
framework for handling most of these grundgy details when you finally must.
The book isn't closed. I know of others who are looking for good
alternatives (or perhaps have them). Some of them may publish.
Preston Briggs looking for the great leap forward
Return to the
Search the comp.compilers archives again.