[LLVMdev] Greedy Register Allocation in LLVM 3.0

[Jakob Stoklund Olesen]

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.pdf

Thanks! 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>