<html><body><div style="color:#000; background-color:#fff; font-family:times new roman, new york, times, serif;font-size:12pt"><div style="font-family: 'times new roman', 'new york', times, serif; font-size: 12pt; " class="yui_3_2_0_22_131714715874946"><span>Hi Jakob,</span></div><div style="font-family: 'times new roman', 'new york', times, serif; font-size: 12pt; " class="yui_3_2_0_22_131714715874946"><span><br></span></div><div style="font-size: 12pt; font-family: 'times new roman', 'new york', times, serif; "><span>Yes. I have references. For example, from the top of my head I would name the following papers:</span></div><div><span style="font-size: 12pt;">1) </span><span style="font-size: 16px;">A Generalized Algorithm for Graph-Coloring Register Allocation by </span><span style="font-size: 16px; ">Michael D. Smith, Norman Ramsey and Glenn Holloway</span></div><div style="font-size: 12pt; font-family: 'times new roman', 'new york', times,
serif; "> <a href="http://www.cs.tufts.edu/~nr/pubs/gcra-abstract.html">http://www.cs.tufts.edu/~nr/pubs/gcra-abstract.html</a></div><div style="font-size: 12pt; font-family: 'times new roman', 'new york', times, serif; "><br></div><div><span style="font-size: 12pt;">2) </span><span style="font-size: 16px;">Register allocation by puzzle solving </span><span style="font-size: 16px; ">by Fernando Magno Quintão Pereira, Jens Palsberg</span></div><div><span style="font-size: 16px; "> <a href="http://llvm.org/pubs/2008-06-PLDI-PuzzleSolving.pdf"><font> http://llvm.org/pubs/2008-06-PLDI-PuzzleSolving.pdf</font></a></span></div><div><span style="font-size: 16px;"><br></span></div><div><span style="font-size: 16px;">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.</span></div><div><span style="font-size:
16px;"><br></span></div><div><span style="font-size: 16px;">/Roman</span></div><div><span style="font-size: 16px;"><br></span><blockquote style="font-size: 12pt; border-left-width: 2px; border-left-style: solid; border-left-color: rgb(16, 16, 255); margin-left: 5px; padding-left: 5px; font-family: 'times new roman', 'new york', times, serif; "><div style="font-size: 12pt; font-family: 'times new roman', 'new york', times, serif; "><div style="font-size: 12pt; font-family: 'times new roman', 'new york', times, serif; "><font size="2" face="Arial"><hr size="1"><b><span style="font-weight:bold;">Von:</span></b> Jakob Stoklund Olesen <stoklund@2pi.dk><br><b><span style="font-weight: bold;">An:</span></b> Leo Romanoff <romixlev@yahoo.com><br><b><span style="font-weight: bold;">Cc:</span></b> "llvmdev@cs.uiuc.edu List" <llvmdev@cs.uiuc.edu><br><b><span style="font-weight: bold;">Gesendet:</span></b> 16:18 Dienstag, 27.September 2011
<br><b><span style="font-weight: bold;">Betreff:</span></b> Re: [LLVMdev] Greedy Register Allocation in LLVM 3.0<br></font><br><div id="yiv1809335356"><br><div><div>On Sep 27, 2011, at 12:11 AM, Leo Romanoff wrote:</div><br class="yiv1809335356Apple-interchange-newline"><blockquote type="cite"><span class="yiv1809335356Apple-style-span" style="border-collapse: separate; font-style: normal; font-variant: normal; font-weight: normal; letter-spacing: normal; line-height: normal; orphans: 2; text-indent: 0px; text-transform: none; white-space: normal; widows: 2; word-spacing: 0px; font-size: medium; font-family: Optima; "><span class="yiv1809335356Apple-style-span" style="font-family: monospace; ">Quite some of these register allocation proposals are also able to handle overlapping register classes.</span></span></blockquote></div><br><div>That's interesting. Do you have any
references?</div><div><br></div><div>/jakob</div><div><br></div></div><br><br></div></div></blockquote></div></div></body></html>