Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!uunet!world!esegue!compilers-sender
From: pkolte@cs.clemson.edu
Newsgroups: comp.compilers
Subject: Reg. Alloc. - Graph Coloring
Keywords: optimize, design
Message-ID: <9010181425.AA15324@cs.clemson.edu>
Date: 18 Oct 90 14:24:59 GMT
Sender: compilers-sender@esegue.segue.boston.ma.us
Reply-To: pkolte@cs.clemson.edu
Organization: Compilers Central
Lines: 16
Approved: compilers@esegue.segue.boston.ma.us

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]
-- 
Send compilers articles to compilers@esegue.segue.boston.ma.us
{ima | spdcc | world}!esegue.  Meta-mail to compilers-request@esegue.