[llvm-commits] CVS: llvm-www/pubs/2006-01-LabrecqueMSThesis.html 2006-01-LabrecqueMSThesis.pdf index.html

Wed Jun 13 17:48:59 PDT 2007

Changes in directory llvm-www/pubs:

2006-01-LabrecqueMSThesis.html added (r1.1)
2006-01-LabrecqueMSThesis.pdf added (r1.1)
index.html updated: 1.51 -> 1.52
---
Log message:

add an llvm-using thesis


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

 2006-01-LabrecqueMSThesis.html |   55 +++++++++++++++++++++++++++++++++++++++++
 2006-01-LabrecqueMSThesis.pdf  |    0 
 index.html                     |    7 +++++
 3 files changed, 62 insertions(+)


Index: llvm-www/pubs/2006-01-LabrecqueMSThesis.html
diff -c /dev/null llvm-www/pubs/2006-01-LabrecqueMSThesis.html:1.1
*** /dev/null	Wed Jun 13 19:48:47 2007

--- llvm-www/pubs/2006-01-LabrecqueMSThesis.html	Wed Jun 13 19:48:37 2007
***************
*** 0 ****
--- 1,55 ----
+ <!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>Towards a Compilation Infrastructure for Network Processors</title>
+ </head>
+ <body>
+ 
+ <div class="pub_title">
+   Towards a Compilation Infrastructure for Network Processors
+ </div>
+ <div class="pub_author">
+   Martin Labrecque, M.S. Thesis
+ </div>
+ 
+ 
+ <h2>Abstract:</h2>
+ <blockquote>
+ <p>
+ Modern network processors (NPs) typically resemble a highly-multithreaded multiprocessor-on- 
+ a-chip, supporting a wide variety of mechanisms for on-chip storage and inter-task communication. 
+ NP applications are themselves composed of many threads that share memory and other resources, 
+ and synchronize and communicate frequently. In contrast, studies of new NP architectures and fea- 
+ tures are often performed by benchmarking a simulation model of the new NP using independent 
+ kernel programs that neither communicate nor share memory. In this paper we present a NP sim- 
+ ulation infrastructure that (i) uses realistic NP applications that are multithreaded, share memory, 
+ synchronize, and communicate; and (ii) automatically maps these applications to a variety of NP 
+ architectures and features. We use our infrastructure to evaluate threading and scaling, on-chip 
+ storage and communication, and to suggest future techniques for automated compilation for NPs.</p>
+ </blockquote>
+ 
+ <h2>Published:</h2>
+ <blockquote>
+   "Towards a Compilation Infrastructure for Network Processors"<br>
+   Martin Labrecque<br>
+   <i>Masters Thesis</i>, Department of Electrical and Computer Engineering, University of Toronto, January, 2006.
+ </blockquote>
+ 
+ <h2>Download:</h2>
+ <ul>
+   <li><a href="2006-01-LabrecqueMSThesis.pdf">Towards a Compilation Infrastructure for Network Processors</a> (PDF)</li>
+ </ul>
+ 
+ <h2>BibTeX Entry:</h2>
+ <pre>
+ @MASTERSTHESIS{np_thesis06,
+   author = {Martin Labrecque},
+   title = {Towards a Compilation Infrastructure for Network Processors},
+   school = {University of Toronto},
+   year = {2006},
+ }</pre>
+ 
+ </body>
+ </html>


Index: llvm-www/pubs/2006-01-LabrecqueMSThesis.pdf


Index: llvm-www/pubs/index.html
diff -u llvm-www/pubs/index.html:1.51 llvm-www/pubs/index.html:1.52
--- llvm-www/pubs/index.html:1.51	Wed Jun 13 19:42:15 2007
+++ llvm-www/pubs/index.html	Wed Jun 13 19:48:37 2007
@@ -61,6 +61,13 @@
 
 <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="2006-01-LabrecqueMSThesis.html">Towards a Compilation Infrastructure for Network Processors</a>"<br>
+Martin Labrecque<br>
+<i>Masters Thesis</i>, Department of Electrical and Computer Engineering, University of Toronto, January, 2006.</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>




