Re: algorithm for computing the interference graph in SSA form?

Paul Haahr <haahr@netcom.com> wrote:
  >I'm looking for an algorithm to quickly compute the interference graph
  >(suitable for use in register allocation) for a program in SSA form.


Preston Briggs wrote:
> If you want to build interference graphs, or register allocators
> in general, then you should be reading my thesis.
>
> author="Preston Briggs",
> title="Register Allocation via Graph Coloring",
> school="Rice University",
> year=1992,
> month=apr
>
> especially the chapter on engineering. At the time, I thought I
> pretty much beat the subject to death, though there have been a couple
> of small improvements since, along with several "improvements" that
> are best avoided.
>
> You can grab a copy via anonymous ftp from ftp.cs.rice.edu,
> in pub/preston/thesis.ps.gz


I'm finishing up my 3rd Briggs-Chaitin allocator, and have been quite
pleased with the results. This last one is used inside a Java system
where compilation speed is paramount.


Cliff


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

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