Jakob Stoklund Olesen
2011-Sep-27 14:18 UTC
[LLVMdev] Greedy Register Allocation in LLVM 3.0
On Sep 27, 2011, at 12:11 AM, Leo Romanoff wrote:> Quite some of these register allocation proposals are also able to handle overlapping register classes.That's interesting. Do you have any references? /jakob -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20110927/e4b1f13d/attachment.html>
Hi Jakob, Yes. I have references. For example, from the top of my head I would name the following papers: 1) A Generalized Algorithm for Graph-Coloring Register Allocation by Michael D. Smith, Norman Ramsey and Glenn Holloway http://www.cs.tufts.edu/~nr/pubs/gcra-abstract.html 2) Register allocation by puzzle solving by Fernando Magno Quintão Pereira, Jens Palsberg http://llvm.org/pubs/2008-06-PLDI-PuzzleSolving.pdf I think I've seen a few more papers on this topic, but cannot remember them at the moment. If I find more papers in my collection I'll let you know. /Roman>________________________________ >Von: Jakob Stoklund Olesen <stoklund at 2pi.dk> >An: Leo Romanoff <romixlev at yahoo.com> >Cc: "llvmdev at cs.uiuc.edu List" <llvmdev at cs.uiuc.edu> >Gesendet: 16:18 Dienstag, 27.September 2011 >Betreff: Re: [LLVMdev] Greedy Register Allocation in LLVM 3.0 > > > > >On Sep 27, 2011, at 12:11 AM, Leo Romanoff wrote: > >Quite some of these register allocation proposals are also able to handle overlapping register classes. > >That's interesting. Do you have any references? > > >/jakob > > > >-------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20110927/f5c3a07c/attachment.html>
Jakob Stoklund Olesen
2011-Sep-27 20:31 UTC
[LLVMdev] Greedy Register Allocation in LLVM 3.0
On Sep 27, 2011, at 11:24 AM, Leo Romanoff wrote:> Hi Jakob, > > Yes. I have references. For example, from the top of my head I would name the following papers: > 1) A Generalized Algorithm for Graph-Coloring Register Allocation by Michael D. Smith, Norman Ramsey and Glenn Holloway > http://www.cs.tufts.edu/~nr/pubs/gcra-abstract.html > > 2) Register allocation by puzzle solving by Fernando Magno Quintão Pereira, Jens Palsberg > http://llvm.org/pubs/2008-06-PLDI-PuzzleSolving.pdfThanks! The introduction to the first paper nicely explains the problem with the traditional algorithms. /jakob -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20110927/1ffbb521/attachment.html>
On Tue, Sep 27, 2011 at 2:24 PM, Leo Romanoff <romixlev at yahoo.com> wrote:> Hi Jakob, > Yes. I have references. For example, from the top of my head I would name > the following papers: > 1) A Generalized Algorithm for Graph-Coloring Register Allocation > by Michael D. Smith, Norman Ramsey and Glenn Holloway > http://www.cs.tufts.edu/~nr/pubs/gcra-abstract.html > 2) Register allocation by puzzle solving by Fernando Magno Quintão Pereira, > Jens Palsberg > http://llvm.org/pubs/2008-06-PLDI-PuzzleSolving.pdfFernando was an intern of mine at Google for the summer (now he's a professor in Brazil :P), and has LLVM code for his allocator. It was quite nice, from what I remember, and quite practical. I doubt the code still works, but he was always interested in seeing it taken over and used for real. (He definitely understood the difference between "research" and "reality"). As Leo says, the "world of register allocation" has definitely caught up to the realities of SSA and newer compilers in the past 5-6 years.> I think I've seen a few more papers on this topic, but cannot remember them > at the moment. If I find more papers in my collection I'll let you know.