|Graph coloring when targeting IA32 processors? email@example.com (2003-06-03)|
|Re: Graph coloring when targeting IA32 processors? firstname.lastname@example.org (2003-06-05)|
|Re: Graph coloring when targeting IA32 processors? email@example.com (Vladimir Makarov) (2003-06-05)|
|From:||firstname.lastname@example.org (Dave Boyle)|
|Date:||3 Jun 2003 01:13:39 -0400|
|Keywords:||386, optimize, question|
|Posted-Date:||03 Jun 2003 01:13:39 EDT|
On page 123 of the third edition of 'Computer Architecture: A
Quantitative Approach', the authors state:
"Graph coloring works best when there are at least 16 (and preferably
more) general-purpose registers available for global allocation for
integer variables and additional registers for floating point.
Unfortunately, graph coloring does not work very well when the number
of registers is small because the heuristic algorithms for coloring
the graph are likely to fail."
Does this mean that graph coloring is rarely (or possibly never) used
by compilers targeting the IA32 family of processors, with their eight
Thanks in advance for your thoughts.
[It's true. It doesn't help that most of the x86 registers have magic
properties so they're not really interchangable with each other. -John]
Return to the
Search the comp.compilers archives again.