Content

• Research Interests
  
• Current Projects
  
• Teachings
  
• Doctoral Thesis
  
• All Publications

Dr. Armin Größlinger

• Loop parallelization in the polyhedron model and in more general models
• Compilation and optimization techniques for general-purpose GPU computing (GPGPU)

• LooPo, a polyhedral loop parallelizer.
• CADGen, a loop code generator for semi-algebraic iteration sets (i.e., iteration sets bounded by polynomials in the variables and parameters) based on cylindrical algebraic decomposition.

• Siehe Stud.IP

• Armin Größlinger. The Challenges of Non-linear Parameters and Variables in Automatic Loop Parallelisation. Doctoral thesis, University of Passau, December 2009. Slides of the defense ("Rigorosum"): rigorosum-slides.pdf

• Tobias Grosser, Hongbin Zheng, Ragesh Aloor, Andreas Simbürger, Armin Größlinger, and Louis-Noël Pouchet. Polly – Polyhedral Optimization in LLVM. In Christophe Alias and Cédric Bastoul, editors, Proceedings of the First International Workshop on Polyhedral Compilation Techniques (IMPACT). INRIA Grenoble Rhône-Alpes, April 2011.
   
• Soufiane Baghdadi, Armin Größlinger, and Albert Cohen. Putting Automatic Polyhedral Compilation for GPGPU to Work. In Proc. of Compilers for Parallel Computers (CPC), 2010.
   
• Sven Apel, Christian Kästner, Armin Größlinger, and Christian Lengauer. Type Safety for Feature-Oriented Product Lines. Automated Software Engineering, 17(3):251–300, September 2010.
   
• Armin Größlinger. Precise Management of Scratchpad Memories for Localising Array Accesses in Scientific Codes. In O. de Moor and M. Schwartzbach, editors, Proceedings of the International Conference on Compiler Construction (CC 2009), number 5501 in Lecture Notes in Computer Science, pages 236–250. Springer-Verlag, 2009.
   
• Armin Größlinger. The Challenges of Non-linear Parameters and Variables in Automatic Loop Parallelisation. doctoral thesis, Department of Informatics and Mathematics, University of Passau, December 2009.
   
• Sven Apel, Christian Kästner, Armin Größlinger, and Christian Lengauer. Feature (De)composition in Functional Programming. In Proceedings of the International Conference on Software Composition (SC), number 5634 in Lecture Notes in Computer Science, pages 9–26. Springer-Verlag, July 2009. Acceptance rate: 33% (10 / 30).
   
• Sven Apel, Christian Kästner, Armin Größlinger, and Christian Lengauer. Type-Safe Feature-Oriented Product Lines. Technical Report MIP-0909, Department of Informatics and Mathematics, University of Passau, June 2009.
   
• Armin Größlinger. Scanning Index Sets with Polynomial Bounds Using Cylindrical Algebraic Decomposition. Technical Report MIP-0803, Fakultät für Informatik und Mathematik, Universität Passau, 2008.
   
• Armin Größlinger. Some Experiments on Tiling Loop Programs for Shared-Memory Multicore Architectures. In Albert Cohen, María J. Garzarán, Christian Lengauer, and Samuel P. Midkiff, editors, Programming Models for Ubiquitous Parallelism, number 07361 in Dagstuhl Seminar Proceedings, Dagstuhl, Germany, 2008. Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany.
   
• Sven Apel, Christian Kästner, Armin Größlinger, and Christian Lengauer. On Feature Orientation and Functional Programming. Technical Report MIP-0806, Department of Informatics and Mathematics, University of Passau, November 2008.
   
• Armin Größlinger and Stefan Schuster. On Computing Solutions of Linear Diophantine Equations with One Non-linear Parameter. In Proceedings of the 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2008), pages 69–76. IEEE Computer Society Press, September 2008.
   
• Stefan Schuster and Armin Größlinger. On Computing Solutions of Linear Diophantine Equations with One Non-linear Parameter. Extended abstract presented at MACIS 2007: http://www-spiral.lip6.fr/MACIS2007/schedule.html (unpublished), December 2007.
   
• Armin Größlinger, Martin Griebl, and Christian Lengauer. Quantifier Elimination in Automatic Loop Parallelization. Journal of Symbolic Computation, 41(11):1206–1221, November 2006.
   
• Martin Griebl, Paul Feautrier, and Armin Größlinger. Forward Communication Only Placements and their Use for Parallel Program Construction. In Languages and Compilers for Parallel Computing, 15th International Workshop, LCPC'02. Revised Papers, Lecture Notes in Computer Science 2481, pages 16–30. Springer-Verlag, 2005. doi:10.1007/11596110_2.
   
• Armin Größlinger, Martin Griebl, and Christian Lengauer. Quantifier Elimination in Automatic Loop Parallelization. In Andreas Dolzmann, Andreas Seidl, and Thomas Sturm, editors, Algorithmic Algebra and Logic (A3L 2005), pages 123–128. Books on Demand GmbH, Norderstedt, April 2005.
   
• Armin Größlinger, Martin Griebl, and Christian Lengauer. Introducing Non-linear Parameters to the Polyhedron Model. In Michael Gerndt and Edmond Kereku, editors, Proceedings of the 11th Workshop on Compilers for Parallel Computers (CPC 2004), Research Report Series LRR-TUM, pages 1–12. Technische Universität München, 2004.
   
• Armin Größlinger. Extending the Polyhedron Model to Inequality Systems with Non-linear Parameters using Quantifier Elimination. Master's thesis, Department of Informatics and Mathematics, University of Passau, 2003.