Re: graph coloring

napi@ms.mimos.my (Mohd Hanafiah Abdullah)
25 Mar 1996 21:58:28 -0500

          From comp.compilers
Related articles
Graph Coloring rsherry8@comcast.net (Robert Sherry) (2004-02-01)
Re: Graph Coloring jle@forest.owlnet.rice.edu (2004-02-04)
Re: graph coloring Robert.Thorpe@antenova.com (Robert Thorpe) (2004-02-08)
Re: graph coloring jmcenerney@austin.rr.com (John McEnerney) (2004-02-12)
Re: Graph Coloring touati@prism.uvsq.fr (TOUATI Sid) (2004-02-12)
graph coloring bsr@cs.clemson.edu (Ramesh B S) (1996-03-20)
Re: graph coloring dgillies@hpax.cup.hp.com (David Gillies) (1996-03-22)
Re: graph coloring napi@ms.mimos.my (1996-03-25)
graph coloring meleis@ece.neu.edu (1997-06-13)
| List of all articles for this month |
From: napi@ms.mimos.my (Mohd Hanafiah Abdullah)
Newsgroups: comp.compilers
Date: 25 Mar 1996 21:58:28 -0500
Organization: Malaysian Inst of Microelectronic Systems
References: 96-03-124
Keywords: optimize

Ramesh B S <bsr@cs.clemson.edu> wrote:
>Are there any standard compilers that use any of the graph coloring
>techniques (like live range analysis, hierarchical coloring etc) to do
>register allocation?


My C compiler is based on Chow and Henessy's Priority Based Graph
Coloring scheme. It uses heuristics to sidestep the NP-complete
problem of coloring, and it also does not spill registers. I'm sure
there are numerous compilers out there that use the same method :-)


Napi
--
http://www.cs.indiana.edu/hyplan/napi.html
--

Post a followup to this message

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