237 lines · html
1<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01//EN"2 "http://www.w3.org/TR/html4/strict.dtd">3<!-- Material used from: HTML 4.01 specs: http://www.w3.org/TR/html401/ -->4<html>5<head>6 <META http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">7 <title>Polly - Publications</title>8 <link type="text/css" rel="stylesheet" href="menu.css">9 <link type="text/css" rel="stylesheet" href="content.css">10</head>11<body>12<div id="box">13<!--#include virtual="menu.html.incl"-->14<div id="content">15 <!--*********************************************************************-->16 <h1>Publications</h1>17 <!--*********************************************************************-->18 19 <h2> Publications about polyhedral compilation </h2>20 <a href="https://polyhedral.info/publications.html">polyhedral.info</a> has a21 large list of publications related to polyhedral compilation. They are very22 useful to get an idea of the latest developments in this area of compilation23 as well as to understand what kind of optimizations can be built on top of24 Polly.25 26 <h2> Citing Polly</h2>27 28 The canonical publication to cite Polly is:29 30<p>31 <em>Polly - Performing polyhedral optimizations on a low-level intermediate32 representation </em><br />33Tobias Grosser, Armin Groesslinger, Christian Lengauer<br />34Parallel Processing Letters 2012 22:04<br />35 <a href="https://www.grosser.es#pub-Polly">Paper</a>36</p>37 38 <h2> Publications involving Polly </h2>39 <h3> 2016 </h3>40 <ul>41 <li><em>Loopy: Programmable and Formally Verified Loop Transformations</em><br />42 Kedar Namjoshi and Nimit Singhania<br />43 23rd Static Analysis Symposium (SAS 2016)<br />44 <a href="https://link.springer.com/chapter/10.1007/978-3-662-53413-7_19">Paper</a>45 </li>46 <li><em>Input Space Splitting for OpenCL</em><br />47 Simon Moll, Johannes Doerfert and Sebastian Hack<br />48 25th International Conference on Compiler Construction (CC 2016)<br />49 </li>50 <li><em>Parallelisation automatique de programmes scientifiques pour systems51 distribues52 </em><br />53 Felix-Antoine Quellet<br />54 Master Thesis, Universite de Sherbrooke<br />55 <a56 href="https://savoirs.usherbrooke.ca/bitstream/handle/11143/8171/Ouellet_Felix_Antoine_MSc_2016.pdf?sequence=4">Thesis</a>57 </li>58 </ul>59 <h3> 2015 </h3>60 <ul>61 <li><em>Polyhedral AST generation is more than scanning polyhedra</em><br />62 Tobias Grosser, Sven Verdoolaege, Albert Cohen<br />63 ACM Transactions on Programming Languages and Systems (TOPLAS), 37(4), July64 2015<br />65 <a href="https://www.grosser.es#pub-polyhedral-AST-generation">Paper</a>66 </li>67 <li><em>On recovering multi-dimensional arrays in Polly</em><br />68 Tobias Grosser, Sebastian Pop, J. Ramanujam, P. Sadayappan <br />69 Impact2015 at HiPEAC, Amsterdam, The Netherlands<br />70 Slides & Paper: <a href="http://impact.gforge.inria.fr/impact2015/">Impact 2015</a>71 </li>72 <li><em>Polly's polyhedral scheduling in the presence of reductions </em><br />73 Johannes Doerfert, Kevin Streit, Sebastian Hack, Zino Benaissa<br />74 Impact2015 at HiPEAC, Amsterdam, The Netherlands<br />75 Slides & Paper: <a href="http://impact.gforge.inria.fr/impact2015/">Impact 2015</a>76 </li>77 </ul>78 <h3> 2014 </h3>79 <ul>80 <li><em>81 Lattice QCD Optimization and Polytopic Representations of Distributed Memory </em><br />82 Michael Kruse<br />83 Doctoral Thesis, Ecole doctorale Informatique de Paris-Sud<br />84 <a href="https://www.theses.fr/2014PA112198">Thesis</a>85 </li>86 </ul>87 <h3> 2012 </h3>88 <ul>89 <li><em>KernelGen - a prototype of auto-parallelizing Fortran/C compiler for NVIDIA GPUs</em><br />90 Dmitry Mikushin, Nikolay Likhogrud, Hou Yunqing, Sergey Kovylov<br />91 Multi-core Workshop 2012, NCAR, Boulder, CO<br /><a92 href="publications/kernelgen-ncar-2012-slides.pdf">Slides</a>93 </li>94 <li><em>KernelGen - a toolchain for automatic GPU-centric applications porting</em><br />95 Nikolay Likhogrud, Dmitry Mikushin, Andrew Adinets<br />96 Parallel Computational Technologies (PCT) 2012, Novosibirsk<br /><a97 href="publications/kernelgen-pavt-2012-slides.pdf">Slides</a>98 </li>99 </ul>100 <h3> 2011 </h3>101 <ul>102 <li><em>Polly - First Successful Optimizations - How to proceed?</em><br />103 Tobias Grosser, Ragesh A<br />104 LLVM Developer Meeting 2011<br /><a105 href="https://llvm.org/devmtg/2011-11/Grosser_PollyOptimizations.pdf">Slides</a>, <a106 href="https://llvm.org/devmtg/2011-11/videos/Grosser_PollyOptimizations-desktop.mov">Video107 (Computer)</a>, <a108 href="https://llvm.org/devmtg/2011-11/videos/Grosser_PollyOptimizations-mobile.mp4">Video109 (Mobile)</a></li>110 <li><em>A Framework for Automatic OpenMP Code Generation</em><br />111 Raghesh A<br />112 Masters Thesis (May 2011)<br />113 <a114 href="publications/raghesh-a-masters-thesis.pdf">Thesis</a>115 </li>116 <li><em>Enabling Polyhedral Optimizations in LLVM</em><br />117 Tobias Grosser<br />118 Diploma Thesis (April 2011)<br />119 <a120 href="publications/grosser-diploma-thesis.pdf">Thesis</a>121 </li>122 <li><em>Polly - Polyhedral Optimization in LLVM</em><br />123 Tobias Grosser, Hongbin Zheng, Ragesh Aloor, Andreas Simbürger, Armin124 Größlinger, Louis-Noël Pouchet<br />125 IMPACT at CGO 2011 <br />126 <a127 href="publications/grosser-impact-2011.pdf">Paper</a>, <a128 href="publications/grosser-impact-2011-slides.pdf">Slides </a>129 </li>130 </ul>131 <h3> 2010 </h3>132 <ul>133 <li><em>Polly - Polyhedral Transformations for LLVM</em><br />134 Tobias Grosser, Hongbin Zheng<br />135 LLVM Developer Meeting 2010<br /><a136 href="https://llvm.org/devmtg/2010-11/Grosser-Polly.pdf">Slides</a>, <a137 href="https://llvm.org/devmtg/2010-11/videos/Grosser_Polly-desktop.mp4">Video138 (Computer)</a>, <a139 href="https://llvm.org/devmtg/2010-11/videos/Grosser_Polly-mobile.mp4">Video140 (Mobile)</a></li>141 </ul>142 143 <h2>Publications used within Polly</h2>144 <h3>Polyhedral library</h3>145 <ul>146 <li><em>isl: An Integer Set Library for the Polyhedral Model </em><br />147 Sven Verdoolaege<br />148 ICMS 2010149 </li>150 </ul>151 <h3>Optimization</h3>152 <ul>153 <li><em>A Practical Automatic Polyhedral Parallelizer and Locality Optimizer154 </em><br />155 Uday Bondhugula, Alberto Hartono, J. Ramanujam, P. Sadayappan<br />156 PLDI 2008157 </li>158 <li><em>Effective Automatic Parallelization and Locality Optimization using159 the Polyhedral Model160 </em><br />161 Uday Bondhugula<br />162 PhD thesis 2008163 </li>164 </ul>165 <h3>Code Generation</h3>166 <ul>167 <li><em>Code Generation in the Polyhedral Model Is Easier Than You Think</em>168 <br />169 Cédric Bastoul<br />170 PACT 2004171 </li>172 </ul>173 <h2>Interesting Publications</h2>174 175 Publications that are not yet used or implemented in Polly, but that are176 interesting to look at either to understand general concepts or to implement177 the corresponding ideas. This list is incomplete and papers are added as178 we hear about them.<br />179 <h3>GPGPU</h3>180 <ul>181 <li><em>Automatic C-to-CUDA Code Generation for Affine Programs</em>182 <br />183 Muthu Manikandan Baskaran, J. Ramanujam and P. Sadayappan<br />184 CC 2010185 </li>186 <li><em>Putting Automatic Polyhedral Compilation for GPGPU to Work<em>187 Soufiane Baghdadi, Armin Größlinger, and Albert Cohen. <br />188 In Proc. of Compilers for Parallel Computers (CPC), 2010.189 </li>190 </ul>191 <h3>Vectorization</h3>192 <ul>193 <li><em>Joint Scheduling and Layout Optimization to Enable Multi-Level194 Vectorization</em>195 <br />196 Nicolas Vasilache, Benoit Meister, Muthu Baskaran, Richard Lethin<br />197 IMPACT 2012 (upcoming)198 </li>199 </ul>200 <h3>Iterative Compilation</h3>201 <ul>202 <li><em>Iterative optimization in the polyhedral model: Part I,203 one-dimensional time. </em>204 <br />205 Louis-Noël Pouchet, Cédric Bastoul, Albert Cohen and Nicolas Vasilache<br />206 CGO 2007207 </li>208 <li><em>Iterative optimization in the polyhedral model: Part II,209 multidimensional time. </em>210 <br />211 Louis-Noël Pouchet, Cédric Bastoul, Albert Cohen and John Cavazos<br />212 PLDI 2008213 </li>214 </ul>215 <h3>Non-static Control</h3>216 <ul>217 <li><em>The Polyhedral Model Is More Widely Applicable Than You Think</em>218 <br />219 Mohamed-Walid Benabderrahmane, Louis-Noël Pouchet, Albert Cohen,220 Cédric221 Bastoul.<br />222 CC 2010223 </li>224 </ul>225 <h3>Source to Source Tools</h3>226 <ul>227 <li><em> Polyhedral Extraction Tool</em>228 <br />229 Sven Verdoolaege, Tobias Grosser<br />230 IMPACT 2012231 </li>232 </ul>233</div>234</div>235</body>236</html>237