[llvm-commits] CVS: llvm-www/pubs/2006-04-04-CGO-GraphColoring.html 2006-04-04-CGO-GraphColoring.pdf index.html

Tue Apr 4 11:25:21 PDT 2006

Changes in directory llvm-www/pubs:

2006-04-04-CGO-GraphColoring.html added (r1.1)
2006-04-04-CGO-GraphColoring.pdf added (r1.1)
index.html updated: 1.35 -> 1.36
---
Log message:

Add a new paper that uses LLVM.


---
Diffs of the changes:  (+49 -0)

 2006-04-04-CGO-GraphColoring.html |   47 ++++++++++++++++++++++++++++++++++++++
 2006-04-04-CGO-GraphColoring.pdf  |    0 
 index.html                        |    2 +
 3 files changed, 49 insertions(+)


Index: llvm-www/pubs/2006-04-04-CGO-GraphColoring.html
diff -c /dev/null llvm-www/pubs/2006-04-04-CGO-GraphColoring.html:1.1
*** /dev/null	Tue Apr  4 13:25:19 2006

--- llvm-www/pubs/2006-04-04-CGO-GraphColoring.html	Tue Apr  4 13:25:09 2006
***************
*** 0 ****
--- 1,47 ----
+ <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+ <html>
+ <head>
+   <meta http-equiv="Content-Type" content="text/html; charset=UTF-8" />
+   <link rel="stylesheet" href="../llvm.css" type="text/css" media="screen" />
+   <title>Tailoring Graph-coloring Register Allocation For Runtime Compilation</title>
+ </head>
+ <body>
+ 
+ <div class="pub_title">
+   Tailoring Graph-coloring Register Allocation For Runtime Compilation
+ </div>
+ <div class="pub_author">
+   Keith D. Cooper and Anshuman Dasgupta
+ </div>
+ 
+ <h2>Abstract:</h2>
+ <blockquote>
+ Just-in-time compilers are invoked during application 
+ execution and therefore need to ensure fast compilation 
+ times. Consequently, runtime compiler designers are averse 
+ to implementing compile-time intensive optimization algorithms. Instead, they tend to select faster but less effective 
+ transformations. In this paper, we explore this trade-off for 
+ an important optimization â global register allocation. We 
+ present a graph-coloring register allocator that has been 
+ redesigned for runtime compilation. Compared to Chaitin-Briggs [7], a standard graph-coloring technique, the reformulated algorithm requires considerably less allocation 
+ time and produces allocations that are only marginally 
+ worse than those of Chaitin-Briggs. Our experimental results indicate that the allocator performs better than the 
+ linear-scan and Chaitin-Briggs allocators on most benchmarks in a runtime compilation environment. By increasing 
+ allocation efficiency and preserving optimization quality, 
+ the presented algorithm increases the suitability and profitability of a graph-coloring register allocation strategy for 
+ a runtime compiler. 
+ </blockquote>
+ 
+ <h2>Published:</h2>
+ <blockquote>
+   "Tailoring Graph-coloring Register Allocation For Runtime Compilation", Keith D. Cooper and Anshuman Dasgupta.<br>
+   Proceedings of the 2006 International Symposium on <a href="http://www.cgo.org/">Code Generation and Optimization</a> (CGO'06), New York, New York, 2006.
+ </blockquote>
+ 
+ <h2>Download:</h2>
+ <ul>
+   <li><a href="2006-04-04-CGO-GraphColoring.pdf">Tailoring Graph-coloring Register Allocation For Runtime Compilation</a> (PDF)</li>
+ </ul>
+ 
+ </body>
+ </html>


Index: llvm-www/pubs/2006-04-04-CGO-GraphColoring.pdf


Index: llvm-www/pubs/index.html
diff -u llvm-www/pubs/index.html:1.35 llvm-www/pubs/index.html:1.36
--- llvm-www/pubs/index.html:1.35	Fri Dec 16 12:33:09 2005
+++ llvm-www/pubs/index.html	Tue Apr  4 13:25:09 2006
@@ -34,6 +34,8 @@
 
 <ol>
 
+<li>"<a href="2006-04-04-CGO-GraphColoring.html">Tailoring Graph-coloring Register Allocation For Runtime Compilation</a>"<br>Keith D. Cooper and Anshuman Dasgupta<br><i> Proc. of the 2006 International Symposium on Code Generation and Optimization (CGO'06)</i>, New York, New York, 2006.<br></li>
+
 <li>"<a href="2005-TR-DSAEvaluation.html">How Successful is Data Structure Analysis in Isolating and Analyzing
   Linked Data Structures?</a>"<br> Patrick Meredith, Balpreet Pankaj, Swarup Sahoo, Chris Lattner and Vikram Adve<br> <i>Technical Report #UIUCDCS-R-2005-2658, Computer Science Dept., Univ. of
 Illinois</i>, Dec. 2005.<br> </li>




