Re: Graph coloring and JIT compilers.

Richard <richard@imagecraft.com>
3 Apr 2006 01:32:13 -0400

          From comp.compilers
Related articles
Graph coloring and JIT compilers. julian_solo13@hotmail.com (Poseidon13) (2006-03-29)
Re: Graph coloring and JIT compilers. dnovillo@redhat.com (Diego Novillo) (2006-04-01)
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: Richard <richard@imagecraft.com>
Newsgroups: comp.compilers
Date: 3 Apr 2006 01:32:13 -0400
Organization: Posted via Supernews, http://www.supernews.com
References: 06-03-097
Keywords: optimize
Posted-Date: 03 Apr 2006 01:32:12 EDT

Poseidon13 wrote:
>...
> In a Java Just-In-Time compiler(JIT) it is essential to minimise the time
> spent on code generation. Is graph coloring a good approach to register
> allocation in a JIT?
>
What is the average time complexity of graph coloring and what is the
worse case? Figure that out and you are on your way in answering the
question. When all else fails, goodle "JIT register allocation" should
give you plenty hit on Linear Scan register allocation.


Post a followup to this message

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