The Ohio State University

Louis-Noël Pouchet
University of California Los Angeles
Computer Science Department
4731L Boelter Hall
Los Angeles, CA 90095

office: (+1) 310-825-8805
cell: (+1) 614-859-5115
email: pouchet@cs.ucla.edu
office: BH4731L
Louis-Noel Pouchet

[News] [Position] [Software] [Lectures] [Publications]

News


Position

I am currently visiting assistant professor in the Computer Science Department of UCLA. I am an active member of the Center for Domain-Specific Computing. I work on a variety of topics for high-performance computing, and in particular I develop compiler technologies based on the polyhedral framework. I will teach CS33 during fall'12, and CS31 during winter'13.

Until August 2012, I was a post-doctoral researcher at Ohio State University, working with Prof. P. Sadayappan. I was a member of CDSC, and I was also an active member of the Platform-Aware Compilation Environment project (DARPA), where I contributed a polyhedral compilation engine (PolyOpt) for the ROSE compiler.

I received a Ph.D in Computer Science in Jan. 2010, for my work at the ALCHEMY group, INRIA Saclay. I was advised by Albert Cohen and Cédric Bastoul. In 2006, I graduated from EPITA (a French Engineer school specialized in Computer Science) and received a Master's degree in Computer Science (minor in Cognitive Sciences) from the University of Paris-Sud XI.

I am working on several areas of high-performance computing:


Software

LetSee, PACE, AutoSkelet and LoopbackPortForwarding are released under the GNU GPL (v2) license. FM is released under the GNU Lesser GPL (v3) license starting version 0.5.0, and GPL v2 for previous versions.


Lectures (graduate level, Ohio State)

For the lectures I do at UCLA (CS33/CS31), please use UCLA's CourseWeb website

Part I: Theory

  • 888.11 - Polyhedral Compilation Foundations, lecture I.1: Iteration domains and polyhedra
[slides] [notes]
  • 888.11 - Polyhedral Compilation Foundations, lecture I.2: Data dependences
[slides] [notes]
  • 888.11 - Polyhedral Compilation Foundations, lecture I.3: Scheduling and Optimization - I
[slides] [notes]
  • 888.11 - Polyhedral Compilation Foundations, lecture I.4: Scheduling and Optimization - II
[slides] [notes]
  • 888.11 - Polyhedral Compilation Foundations, lecture I.5: Scheduling and Optimization - III
[slides] [notes]

Part II: Practice

  • 888.11 - Polyhedral Compilation Foundations, lecture II.1: Dependence polyhedra
[notes]  
  • 888.11 - Polyhedral Compilation Foundations, lecture II.2: Dependence polyhedra, again
[notes]  
  • 888.11 - Polyhedral Compilation Foundations, lecture II.3: Dependence polyhedra and program Legality
[notes]  
  • 888.11 - Polyhedral Compilation Foundations, lecture II.4: Scanning Polyhedra
[notes]  

Part III: Communication management

  • 888.11 - Polyhedral Compilation Foundations, exercise III.1: Data space
[notes]  
  • 888.11 - Polyhedral Compilation Foundations, exercise III.2: Tiling
[notes]  
  • 888.11 - Polyhedral Compilation Foundations, exercise III.3: Communication generation
[notes]  

Methodology and problem solving

  • 888.11 - Iterator Live-out value, lecture 1: Formulating the problem
[slides] [notes]
  • 888.11 - Iterator Live-out value, lecture 2: Writing algorithms
[slides] [notes]
  • 888.11 - Iterator Live-out value, lecture 3: Solving the problem, part I
[slides] [notes]
  • 888.11 - Iterator Live-out value, lecture 4: Solving the problem, part II
[slides] [notes]
  • 888.11 - Iterator Live-out value, lecture 5: General algorithm for the Live-out Iterator Problem
[slides] [notes]
  • 888.11 - Iterator Live-out value, lecture 6: "Proving" your algorithm
[slides] [notes]

Randomly selected topics

  • 888.11 - Vectorization in the Polyhedral Model, lecture 1: Pre-transformations for vectorizability
[slides] [notes]
  • 888.11 - Vectorization in the Polyhedral Model, lecture 2: Transformation Selection for Good Vectorization
[slides] [notes]

Publications

    In conferences and journals

  1. Tom Henretty, Richard Veras, Franz Franchetti, Louis-Noël Pouchet, J. Ramanujam and P. Sadayappan.
    A Stencil Compiler for Short-Vector SIMD Architectures.
    In ACM International Conference on Supercomputing (ICS'13). ACM Press, Eugene, OR, June 2013. Accepted for publication.

    [bibtex-entry] [pdf] [slides]
  2. Martin Kong, Richard Veras, Kevin Stock, Franz Franchetti, Louis-Noël Pouchet and P. Sadayappan.
    When Polyhedral Transformations Meet SIMD Code Generation.
    In ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI'13). ACM Press, Seattle, WA, June 2013. Accepted for publication.

    [bibtex-entry] [pdf] [slides]
  3. Eunjung Park, John Cavazos, Louis-Noël Pouchet, Cédric Bastoul, Albert Cohen and P. Sadayappan.
    Predictive Modeling in a Polyhedral Optimization Space.
    In International Journal of Parallel Programming (IJPP). Springer Verlag, 2013. In press.

    [bibtex-entry] [pdf]
  4. Louis-Noël Pouchet, Peng Zhang, P. Sadayappan and Jason Cong.
    Polyhedral-Based Data Reuse Optimization for Configurable Computing.
    In 21st ACM/SIGDA International Symposium on Field-Programmable Gate Arrays (FPGA'13). ACM Press, Monterey, California, February 2013.

    [bibtex-entry] [pdf] [slides]
  5. Mahesh Ravishankar, John Eisenlohr, Louis-Noël Pouchet, J. Ramanujam, Atanas Rountev and P. Sadayappan.
    Code Generation for Parallel Execution of a Class of Irregular Loops on Distributed Memory Systems.
    In IEEE Conference on Conference on High Performance Computing, Networking, Storage and Analysis (SC'12). IEEE Computer Society Press, Salt Lake City, Utah, November 2013.

    [bibtex-entry] [pdf] [slides]
  6. Justin Holewinski, Louis-Noël Pouchet and P. Sadayappan.
    High-Performance Code Generation for Stencil Computations on GPU Architectures.
    In ACM International Conference on Supercomputing (ICS'12). ACM Press, Venice, Italy, June 2012.

    [bibtex-entry] [pdf] [slides]
  7. Justin Holewinski, Ragavendar Ramamurthi, Mahesh Ravishankar, Naznin Fauzia, Louis-Noël Pouchet, Atanas Rountev and P. Sadayappan.
    Dynamic Trace-Based Analysis of Vectorization Potential of Applications.
    In ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI'12). ACM Press, Beijing, China, June 2012.

    [bibtex-entry] [pdf] [slides]
  8. Jun Shirako, Kamal Sharma, Naznin Fauzia, Louis-Noël Pouchet, J. Ramanujam,P. Sadayappan and Vivek Sarkar.
    Analytical Bounds for Optimal Tile Size Selection.
    In ETAPS International Conference on Compiler Construction (CC'2012). Springer Verlag, Tallinn, Estonia, March 2012.

    [bibtex-entry] [pdf] [slides]
  9. Kevin Stock, Louis-Noël Pouchet and P. Sadayappan.
    Using Machine Learning to Improve Automatic Vectorization.
    In ACM Transactions on Architecture and Code Optimization (TACO). Special issue on high-performance and embedded architectures and compilers, Volume 8 Issue 4, January 2012.

    [bibtex-entry] [pdf] [[slides]
  10. Sanket Tavarageri, Louis-Noël Pouchet, Ramanujam, Atanas Rountev and P. Sadayappan.
    Dynamic Selection of Tile Sizes.
    In 18th IEEE International Conference on High Performance Computing (HiPC'11). Bangalore, India, December 2011.

    [bibtex-entry] [pdf] [slides]
  11. Naser Sedaghati, Renji Thomas, Louis-Noël Pouchet, Radu Teodorescu and P. Sadayappan.
    StVEC: A Vector Instruction Extension for High Performance Stencil Computation.
    In 20th IEEE International Conference on Parallel Architecture and Compilation Techniques (PACT'11). Galveston Island, Texas, October 2011.

    [bibtex-entry] [pdf] [slides]
  12. Eunjung Park, Louis-Noël Pouchet, John Cavazos, Albert Cohen and P. Sadayappan.
    Predictive Modeling in a Polyhedral Optimization Space.
    In 9th IEEE/ACM International Symposium on Code Generation and Optimization (CGO'11). pp 119--129, Chamonix, France, April 2011.

    [bibtex-entry] [pdf] [slides]
  13. Tom Henretty, Kevin Stock, Louis-Noël Pouchet, Franz Franchetti, J. Ramanujam and P. Sadayappan.
    Data Layout Transformation for Stencil Computations on Short-Vector SIMD Architectures.
    In ETAPS International Conference on Compiler Construction (CC'2011). pp 225--245, Springer Verlag, Saarbrucken, Germany, March 2011.

    [bibtex-entry] [pdf] [slides]
  14. Louis-Noël Pouchet, Uday Bondhugula, Cédric Bastoul, Albert Cohen, J. Ramanujam, P. Sadayappan and Nicolas Vasilache.
    Loop Transformations: Convexity, Pruning and Optimization.
    In 38th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (POPL'11). pp 549--562, Austin, TX, January 2011. Also appeared in ACM SIGPLAN Notices 46(1):549--562.

    [bibtex-entry] [pdf] [slides]
  15. H. Munk, E. Ayguadé, C. Bastoul, P. Carpenter, Z. Chamski, A. Cohen, M. Cornero, P. Dumont, M. Duranton, M. Fellahi, R. Ferrer, R. Ladelsky, M. Lindwer, X. Martorell, C. Miranda, D. Nuzman, A. Ornstein, A. Pop, S. Pop, L.-N. Pouchet, A. Ramirez, D. Rodenas, E. Rohou, I. Rosen, U. Shvadron, K. Trifunovic, and A. Zaks.
    ACOTES Project: Advanced Compiler Technologies for Embedded Streaming.
    In International Journal of Parallel Programming (IJPP). 2011. Special issue on European HiPEAC network of excellence member's projects.

    [bibtex-entry] [pdf]
  16. Louis-Noël Pouchet, Uday Bondhugula, Cédric Bastoul, Albert Cohen, J. Ramanujam and P. Sadayappan.
    Combined Iterative and Model-driven Optimization in an Automatic Parallelization Framework.
    In IEEE Conference on Supercomputing (SC'2010). New Orleans, LA, November 2010.

    [bibtex-entry] [pdf] [slides]
  17. Mohamed-Walid Benabderrahmane, Louis-Noël Pouchet, Albert Cohen, Cédric Bastoul.
    The Polyhedral Model Is More Widely Applicable Than You Think.
    In ETAPS International Conference on Compiler Construction (CC'2010). pp 283--303, Springer Verlag, Paphos, Cyprus, March 2010.

    [bibtex-entry] [pdf] [slides]
  18. Louis-Noël Pouchet, Cédric Bastoul, Albert Cohen and John Cavazos.
    Iterative Optimization in the Polyhedral Model: Part II, Multidimensional Time.
    In ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI'08). pp 90--100, ACM Press, Tucson, Arizona, June 2008. Also appeared in ACM SIGPLAN Notices 43(6):90--100.

    [bibtex-entry] [pdf] [slides]
  19. Nicolas Vasilache, Albert Cohen and Louis-Noël Pouchet.
    Automatic Correction of Loop Transformations.
    In 16th IEEE International Conference on Parallel Architecture and Compilation Techniques (PACT'07). pp 292--304, IEEE Computer Society Press, Brasov, Roumania, September 2007.

    [bibtex-entry] [pdf]
  20. Louis-Noël Pouchet, Cédric Bastoul, Albert Cohen and Nicolas Vasilache.
    Iterative Optimization in the Polyhedral Model: Part I, One-dimensional Time.
    In 5th IEEE/ACM International Symposium on Code Generation and Optimization (CGO'07). pp 144--156, IEEE Computer Society Press, San Jose, California, March 2007.

    [bibtex-entry] [pdf] [slides]
  21. Thomas Claveirole, Sylvain Lombardy, Sarah O'Connor, Louis-Noël Pouchet and Jacques Sakarovitch.
    Inside Vaucanson.
    In 10th International Conference on Implementation and Application of Automata (CIAA'05). pp. 117--128, Lecture Notes in Computer Science Series, Vol. 3845, Springer-Verlag, Sophia-Antipolis, France, June 2005.

    [bibtex-entry] [pdf] [slides]
  22. In workshops

  23. 3rd International Workshop on Polyhedral Compilation Techniques.
    61 pages. Berlin, January 2013.

    [bibtex-entry] [pdf] [website]
  24. Kevin Stock, Louis-Noël Pouchet and P. Sadayappan.
    Automatic Transformations for Effective Parallel Execution on Intel Many Integrated Core.
    In TACC-Intel Highly Parallel Computing Symposium. Austin, TX, April 2012.

    [bibtex-entry] [pdf] [slides]
  25. Tobias Grosser, Hongbin Zheng, Raghesh A, Andreas Simburger, Armin Grosslinger and Louis-Noël Pouchet.
    Polly - Polyhedral Optimization in LLVM.
    In First International Workshop on Polyhedral Compilation Techniques (IMPACT'11). Chamonix, France, April 2011.

    [bibtex-entry] [pdf] [slides]
  26. Sanket Tavarageri, Albert Hartono, Muthu Baskaran, Louis-Noël Pouchet, J. Ramanujam and P. Sadayappan.
    Parametric Tiling of Affine Loop Nests.
    In 15th Workshop on Compilers for Parallel Computing (CPC'10). Vienna, Austria, July 2010.

    [bibtex-entry] [pdf]
  27. Riyadh Baghdadi, Albert Cohen, Cédric Bastoul, Louis-Noël Pouchet and Lawrence Rauchwerger.
    The Potential of Synergistic Static, Dynamic and Speculative Loop Nest Optimizations for Automatic Parallelization.
    In 3rd Workshop on Parallel Execution of Sequential Programs on Multi-core Architectures (PESPMA'10). Saint-Malo, France, June 2010. Position paper.

    [bibtex-entry] [pdf]
  28. Mohammed Rahman, Louis-Noël Pouchet and P. Sadayappan.
    Neural Network Assisted Tile Size Selection.
    In 5th International Workshop on Automatic Performance Tuning (iWAPT'10). Berkeley, CA, USA, June 2010.

    [bibtex-entry] [pdf] [slides]
  29. K. Ibrahim, J. Jaeger, Z. Liu, L.N. Pouchet, P. Lesnicki, L. Djoudi, D.Barthou, F. Bodin, C. Eisenbeis, G. Grosdidier, O. Pene and P. Roudeau.
    Simulation of the Lattice QCD and Technological Trends in Computation.
    In 14th Workshop on Compilers for Parallel Computing (CPC'09). Zurich, Switzerland, January 2009.

    [bibtex-entry] [pdf]
  30. Louis-Noël Pouchet, Cédric Bastoul, John Cavazos and Albert Cohen.
    A Note on the Performance Distribution of Affine Schedules.
    In 2nd Workshop on Statistical and Machine learning approaches to ARchitectures and compilaTion (SMART'08). Gotenborg, Sweden, January 2008.

    [bibtex-entry] [pdf] [slides]
  31. Louis-Noël Pouchet, Cédric Bastoul and Albert Cohen.
    Iterative Optimization in the Polyhedral Model: the One-dimensional Affine Scheduling Case.
    In 2nd HiPEAC Industrial Workshop. Eindhoven, the Netherlands, October 2006.

    [bibtex-entry] [pdf] [slides]
  32. Miscellaneous

  33. Louis-Noël Pouchet, Uday Bondhugula, Cédric Bastoul, Albert Cohen, J. Ramanujam and P. Sadayappan.
    Hybrid Iterative and Model-Driven Optimization in the Polyhedral Model.
    In INRIA Research Report 6962. June 2009.

    [bibtex-entry] [pdf]
  34. Mohamed-Walid Benabderrahmane, Cédric Bastoul, Louis-Noël Pouchet and Albert Cohen.
    A Conservative Approach to Handle Full Functions in the Polyhedral Model.
    In INRIA Research Report 6814. January 2009.

    [bibtex-entry] [pdf]
  35. Louis-Noël Pouchet, Cédric Bastoul and Albert Cohen.
    LeTSeE: the LEgal Transformation SpacE Explorator.
    In Third International Summer School on Advanced Computer Architecture and Compilation for Embedded Systems. pp 247--251, L'Aquila, Italia, July 2007. Extended abstract.

    [bibtex-entry] [pdf] [poster]
  36. Louis-Noël Pouchet.
    An Interpreter for Vaucanson.
    In EPITA Research and Development Laboratory Seminar. Le Kremlin-Bicetre, France, June 2004.

    [bibtex-entry] [pdf] [slides]
  37. Thesis

  38. Louis-Noël Pouchet.
    Iterative Optimization in the Polyhedral Model.
    Ph.D (University of Paris-Sud XI). Orsay, France, January 2010.

    [bibtex-entry] [pdf] [slides]
  39. Louis-Noël Pouchet.
    When Iterative Optimization Meets the Polyhedral Model: One-dimensional Date.
    Master thesis (University of Paris-Sud XI). Orsay, France, October 2006.

    [bibtex-entry] [pdf] [slides]

Copyright notice This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.