[llvm-commits] CVS: llvm-www/pubs/2008-CGO-DagISel.html 2008-CGO-DagISel.pdf

Thu Jan 24 14:51:48 PST 2008

Changes in directory llvm-www/pubs:

2008-CGO-DagISel.html added (r1.1)
2008-CGO-DagISel.pdf added (r1.1)
---
Log message:

add a paper on near optimal instruction selection

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

 2008-CGO-DagISel.html |   48 ++++++++++++++++++++++++++++++++++++++++++++++++
 2008-CGO-DagISel.pdf  |    0 
 2 files changed, 48 insertions(+)

Index: llvm-www/pubs/2008-CGO-DagISel.html
diff -c /dev/null llvm-www/pubs/2008-CGO-DagISel.html:1.1
*** /dev/null	Thu Jan 24 16:51:13 2008
--- llvm-www/pubs/2008-CGO-DagISel.html	Thu Jan 24 16:51:03 2008
***************
*** 0 ****
--- 1,48 ----
+ <!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>Near-Optimal Instruction Selection on DAGs</title>
+ </head>
+ <body>
+ 
+ <div class="pub_title">
+ Near-Optimal Instruction Selection on DAGs
+ </div>
+ <div class="pub_author">
+   David Ryan Koes and Seth Copen Goldstein
+ </div>
+ 
+ <h2>Abstract:</h2>
+ <blockquote>
+ Instruction selection is a key component of code generation. High 
+ quality instruction selection is of particular importance in the embedded space where complex instruction sets are common and code 
+ size is a prime concern. Although instruction selection on tree expressions is a well understood and easily solved problem, instruction selection on directed acyclic graphs is NP-complete. In this 
+ paper we present NOLTIS, a near-optimal, linear time instruction 
+ selection algorithm for DAG expressions. NOLTIS is easy to im- 
+ plement, fast, and effective with a demonstrated average code size 
+ improvement of 5.1% compared to the traditional tree decomposi- 
+ tion and tiling approach. 
+ </blockquote>
+ 
+ <h2>Published:</h2>
+ "Near-Optimal Instruction Selection on DAGs"<br>
+ David Ryan Koes and Seth Copen Goldstein<br>
+ <i>Proc. ACM Conference on Code Generation and Optimization (CGO'08)</i>, Boston, MA, 2008.
+ 
+ <h2>Download:</h2>
+ <h3>Paper:</h3>
+ <ul>
+   <li><a href="2008-CGO-DagISel.pdf">Near-Optimal Instruction Selection on DAGs</a> (PDF)</li>
+ </ul>
+ 
+ <!-- *********************************************************************** -->
+ <hr>
+   <a href="http://jigsaw.w3.org/css-validator/check/referer"><img
+   src="http://jigsaw.w3.org/css-validator/images/vcss" alt="Valid CSS!"></a>
+   <a href="http://validator.w3.org/check/referer"><img
+   src="http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01!" /></a>
+ 
+ </body>
+ </html>

Index: llvm-www/pubs/2008-CGO-DagISel.pdf