|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)|
|Date:||Thu, 18 Oct 90 10:24:59 EDT|
We are studying register allocation techniques in our compiler course.
Are there any register allocation techniques that do not use some variation
of graph coloring ? Almost every paper on register allocation seems to
present enhancements or slight modifications to Chaitin's idea. Is anyone
trying (or has tried) anything different from the idea of COLORING
INTERFERENCE GRAPHS ? Thank you.
Computer Science Dept. Clemson University. Clemson SC 29634
[Before graph coloring, there was the traditional approach of treating the
registers more or less as a stack. -John]
Return to the
Search the comp.compilers archives again.