Graph coloring and JIT compilers.

"Inderaj Bains" <inderaj@gmail.com>
3 Apr 2006 01:41:31 -0400

          From comp.compilers

Related articles
[2 earlier articles]
Re: Graph coloring and JIT compilers. aghuloum@cs.indiana.edu (Abdulaziz Ghuloum) (2006-04-01)
Re: Graph coloring and JIT compilers. bonzini@gnu.org (Paolo Bonzini) (2006-04-01)
Re: Graph coloring and JIT compilers. torbenm@app-4.diku.dk (2006-04-03)
Re: Graph coloring and JIT compilers. richard@imagecraft.com (Richard) (2006-04-03)
Re: Graph coloring and JIT compilers. oliverhunt@gmail.com (oliverhunt@gmail.com) (2006-04-03)
Re: Graph coloring and JIT compilers. anton@mips.complang.tuwien.ac.at (2006-04-03)
Graph coloring and JIT compilers. inderaj@gmail.com (Inderaj Bains) (2006-04-03)
Re: Graph coloring and JIT compilers. anton@mips.complang.tuwien.ac.at (2006-04-08)
| List of all articles for this month |

From: "Inderaj Bains" <inderaj@gmail.com>
Newsgroups: comp.compilers
Date: 3 Apr 2006 01:41:31 -0400
Organization: Compilers Central
Keywords: optimize
Content-Disposition: inline

Though graph coloring works, the time is not usually acceptable. It is
something one would not put in a production compiler.
I would rather use linear scan algorithm {1}. Its performace in within
about 10-12% of graph coloring and I feel the graph coloring is rarely
justified, even if the code if on hot path.


Also an excellent paper on how balance of compile time and run time
performance plays out in JIT environment is this paper from IBM
research {2} . I found it to be an excellent summarizing paper. One
reading of this and you should have very good feel for techniques to
use.


Regards,


~Inderaj


{1} Linear Scan Register Allocation (1999)
Massimiliano Poletto, Vivek Sarkar ACM TOPLAS


{2} Design and evaluation of Dynamic Optimizations for Java
Just-in-Time Compiler
Toshio Suganuma, Toshiaki Yasue et al.
IBM Tokyo Research Laboratory



Post a followup to this message

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