Re: Is register allocation really NP-Complete?

preston@ariel.rice.edu (Preston Briggs)
Wed, 27 Mar 91 15:07:23 GMT

          From comp.compilers
Related articles
Is register allocation really NP-Complete? payne@zeus.unomaha.edu (1991-03-26)
Re: Is register allocation really NP-Complete? larus@cs.wisc.edu (1991-03-27)
Re: Is register allocation really NP-Complete? preston@ariel.rice.edu (1991-03-27)
Re: Is register allocation really NP-Complete? david@cs.washington.edu (1991-03-27)
Re: Is register allocation really NP-Complete? preston@ariel.rice.edu (1991-03-28)
Re: Is register allocation really NP-Complete? spencert@cs.rpi.edu (1991-03-31)
| List of all articles for this month |
Newsgroups: comp.compilers
From: preston@ariel.rice.edu (Preston Briggs)
Summary: yep
Keywords: optimization, theory, design
Organization: Rice University, Houston
References: <11422.27ef7017@zeus.unomaha.edu>
Date: Wed, 27 Mar 91 15:07:23 GMT

The interference graph for straight-line code (no branches or loops) will
be an interval graph; otherwise, it's more complex. Chow is interested in
global allocation (over an entire procedure), and must therefore worry
about such things.


Further, he must worry about spill code. Even if he has lots of registers
and achieves a minimal coloring, some programs will still require spill
code.


Preston Briggs


--

Post a followup to this message

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