Reg. Alloc. - Graph Coloring

pkolte@cs.clemson.edu
Thu, 18 Oct 90 10:24:59 EDT

          From comp.compilers
Related articles
Reg. Alloc. - Graph Coloring pkolte@cs.clemson.edu (1990-10-18)
Re: Reg. Alloc. - Graph Coloring preston@titan.rice.edu (1990-10-18)
Re: Reg. Alloc. - Graph Coloring hankd@ecn.purdue.edu (1990-10-19)
Re: Reg. Alloc. - Graph Coloring preston@titan.rice.edu (1990-10-23)
Re: Reg. Alloc. - Graph Coloring siritzky@apollo.hp.com (1990-10-25)
Re: Reg. Alloc. - Graph Coloring preston@titan.rice.edu (1990-10-26)
Re: Reg. Alloc. - Graph Coloring sasmkg@dev.sas.com (1990-11-02)
| List of all articles for this month |
Newsgroups: comp.compilers
From: pkolte@cs.clemson.edu
Keywords: optimize, design
Organization: Compilers Central
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.


-Priyadarshan Kolte
Computer Science Dept. Clemson University. Clemson SC 29634
pkolte@cs.clemson.edu
[Before graph coloring, there was the traditional approach of treating the
registers more or less as a stack. -John]
--

Post a followup to this message

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