[llvm-commits] CVS: llvm/www/pubs/2002-06-AutomaticPoolAllocation.html

Mon May 19 10:44:01 PDT 2003

Changes in directory llvm/www/pubs:

2002-06-AutomaticPoolAllocation.html added (r1.1)

---
Log message:

New file

---
Diffs of the changes:

Index: llvm/www/pubs/2002-06-AutomaticPoolAllocation.html
diff -c /dev/null llvm/www/pubs/2002-06-AutomaticPoolAllocation.html:1.1
*** /dev/null	Mon May 19 10:43:58 2003
--- llvm/www/pubs/2002-06-AutomaticPoolAllocation.html	Mon May 19 10:43:47 2003
***************
*** 0 ****
--- 1,63 ----
+ <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+ <html><head>
+ <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
+ <title>Automatic Pool Allocation for Disjoint Data Structures</title>
+ </head>
+ 
+ <body bgcolor="#FFFFFF" text="#000000"> <!-- leftmargin="0" marginwidth="0" -->
+ 
+ <p align="center"><br> <font size="6"
+ face="Georgia,Palatino,Times,Roman">Automatic Pool Allocation for Disjoint Data
+ Structures</font><br><font size=4>
+     <a href="http://www.nondot.org/sabre/">Chris Lattner</a> and
+     <a href="http://www.cs.uiuc.edu/~vadve">Vikram Adve</a>
+ 
+     </font></p>
+ 
+ 
+ <h2>Abstract:</h2>
+ <blockquote>
+ This paper presents an analysis technique and a novel program transformation
+ that can enable powerful optimizations for entire linked data structures.  The
+ fully automatic transformation converts ordinary programs to use pool (aka
+ region) allocation for heap-based data structures.  The transformation relies on
+ an efficient link-time interprocedural analysis to identify disjoint data
+ structures in the program, to check whether these data structures are accessed
+ in a type-safe manner, and to construct a Disjoint Data Structure Graph that
+ describes the connectivity pattern within such structures.  We present
+ preliminary experimental results showing that the data structure analysis and
+ pool allocation are effective for a set of pointer intensive programs in the
+ Olden benchmark suite.  To illustrate the optimizations that can be enabled by
+ these techniques, we describe a novel pointer compression transformation and
+ briefly discuss several other optimization possibilities for linked data
+ structures.
+ </blockquote>
+ 
+ <h2>Published:</h2>
+ <ul>
+   "Automatic Pool Allocation for Disjoint Data Structures",
+       Chris Lattner & Vikram Adve,<br>
+    ACM SIGPLAN Workshop on Memory System Performance (MSP),
+    Berlin, Germany, June 2002.<br>
+ </ul>
+ 
+ <h2>Download:</h2>
+ <ul>
+ <li><a href="2002-06-AutomaticPoolAllocation.ps">Automatic Pool Allocation for Disjoint Data Structures</a> (PS)
+ <li><a href="2002-06-AutomaticPoolAllocation.pdf">Automatic Pool Allocation for Disjoint Data Structures</a> (PDF)
+ <li><a href="2002-06-AutomaticPoolAllocation.ppt">Automatic Pool Allocation for Disjoint Data Structures</a> (Powerpoint slides)
+ </ul>
+ 
+ <h2>Bibtex Entry:</h2>
+ <pre>
+ @InProceedings{LattnerAdve:MSP02,
+     Author      = {Chris Lattner and Vikram Adve},
+     Title       = {{A}utomatic {P}ool {A}llocation for {D}isjoint {D}ata {S}tructures},
+     Booktitle   = {Proc. ACM SIGPLAN Workshop on Memory System Performance},
+     Address     = {Berlin, Germany},
+     Month       = {Jun},
+     Year        = {2002}
+ }
+ </pre>
+ 
+ </body></html>