Re: coalescing in graph coloring register allocator

Clifford Click <cliff.click@Eng.Sun.COM>
5 Aug 1998 22:24:21 -0400

          From comp.compilers
Related articles
coalescing in graph coloring register allocator jp@altair.snu.ac.kr (jp) (1998-08-03)
Re: coalescing in graph coloring register allocator max@gac.edu (Max Hailperin) (1998-08-04)
Re: coalescing in graph coloring register allocator cliff.click@Eng.Sun.COM (Clifford Click) (1998-08-05)
Re: coalescing in graph coloring register allocator george@research.bell-labs.com (Lal George) (1998-08-10)
Re: coalescing in graph coloring register allocator cliff.click@Eng.Sun.COM (Clifford Click) (1998-08-13)
Re: coalescing in graph coloring register allocator george@research.bell-labs.com (Lal George) (1998-08-16)
Re: coalescing in graph coloring register allocator cliff.click@Eng.Sun.COM (Clifford Click) (1998-08-19)
| List of all articles for this month |
From: Clifford Click <cliff.click@Eng.Sun.COM>
Newsgroups: comp.compilers
Date: 5 Aug 1998 22:24:21 -0400
Organization: Sun Microsystems
References: 98-08-021
Keywords: registers, optimize

jp wrote:
> I'm studying the graph coloring register allocator. I'm wondering
> which coalescing technique out of "aggressive coalescing" by Chaitin
> and "conservative coalescing" by Briggs is preferred in general
> environments that suffer from many copies generated by aggressive
> optimizations like SSA as well as generated at normal compilation
> stages.
>
> Is the preference different between academic area and commercial area?


My compiler is a run-time compiler for Java and has strict
compile-time constraints. I'm running 1 round of agressive
coalescing, and 1 round of conservative coalescing each time I split
live ranges.


Cliff


--
Cliff Click Compiler Designer and Researcher
cliffc at acm.org JavaSoft
(408) 863-3266 MS UCUP02-302
--

Post a followup to this message

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