This is the mail archive of the
mailing list for the GCC project.
Re: Graph coloring for register allocation?
- To: gcc at gcc dot gnu dot org, shebs at apple dot com
- Subject: Re: Graph coloring for register allocation?
- From: dewar at gnat dot com
- Date: Wed, 17 Jan 2001 20:48:05 -0500 (EST)
Well there is loads of work on register allocation and scheduling
since the publication of the IBM algorithm, so I don't think anyone
would use this unchanged. There are many variations on this theme
which certainly are NOT patented (even a small variation on a patent
tends to escape the patenting in the software field).
So rather than ask whether we want to use the IBM patented algorithn
at this stage, I think the appropriate thing is to survey the current
state of the art and ask whether we could be doing better using whatever
algorithms and methods are available.