coalescing in graph coloring register allocator

jp <jp@altair.snu.ac.kr>
3 Aug 1998 17:58:10 -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: jp <jp@altair.snu.ac.kr>
Newsgroups: comp.compilers
Date: 3 Aug 1998 17:58:10 -0400
Organization: Seoul National University, Republic of Korea
Keywords: optimize, analysis

Hi


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?


Hope your answer ASAP.
TIA
--

Post a followup to this message

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