Graph Coloring and Register Allocation

"Robert Sherry" <rsherry8@comcast.net>
20 Dec 2003 11:52:10 -0500

          From comp.compilers
Related articles
Graph Coloring and Register Allocation rsherry8@comcast.net (Robert Sherry) (2003-12-20)
Re: Graph Coloring and Register Allocation danwang74@hotmail.com (Daniel C. Wang) (2003-12-21)
Re: Graph Coloring and Register Allocation anton@mips.complang.tuwien.ac.at (2003-12-21)
Re: Graph Coloring and Register Allocation richard@imagecraft.com (Richard F. Man) (2003-12-21)
Re: Graph Coloring and Register Allocation touati@prism.uvsq.fr (TOUATI Sid) (2003-12-23)
| List of all articles for this month |
From: "Robert Sherry" <rsherry8@comcast.net>
Newsgroups: comp.compilers
Date: 20 Dec 2003 11:52:10 -0500
Organization: Compilers Central
Keywords: registers, optimize, question
Posted-Date: 20 Dec 2003 11:52:10 EST

        I am currently developing a new graph coloring algorithm which I
believe is well suited for use in compilers. These graphs come up in
the register allocation problem. I believe that these graphs tend to
have a lot of vertices of high degree (nearly n where n is the number
of vertices in the graph), as well vertices with very low degrees. I
believe this is true because most variables will be live throughout
the subroutine ( or block ) and compiler generated temporaries will
have a very short life. I am looking for a Journal article that
states this is the case.


                                                        Robert Sherry

Post a followup to this message

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