Armin Größlinger

Affiliations:
  • University of Passau, Department of Informatics and Mathematics, Germany


According to our database1, Armin Größlinger authored at least 19 papers between 2002 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020

2019
Speeding up Iterative Polyhedral Schedule Optimization with Surrogate Performance Models.
ACM Trans. Archit. Code Optim., 2019

PolyJIT: Polyhedral Optimization Just in Time.
Int. J. Parallel Program., 2019

2017
Iterative Schedule Optimization for Parallelization in the Polyhedron Model.
ACM Trans. Archit. Code Optim., 2017

2014
Guest Editors' Note: Special Issue On High-Performance Stencil Computations.
Parallel Process. Lett., 2014

ExaStencils: Advanced Stencil-Code Engineering.
Proceedings of the Euro-Par 2014: Parallel Processing Workshops, 2014

2013
The potential of polyhedral optimization: An empirical study.
Proceedings of the 2013 28th IEEE/ACM International Conference on Automated Software Engineering, 2013

The DAO of Parallel Software Construction.
Proceedings of the ICSOFT 2013, 2013

Strategies for product-line verification: case studies and experiments.
Proceedings of the 35th International Conference on Software Engineering, 2013

2012
Polly - Performing Polyhedral Optimizations on a Low-Level Intermediate Representation.
Parallel Process. Lett., 2012

2010
Type-Safe Feature-Oriented Product Lines
CoRR, 2010

Type safety for feature-oriented product lines.
Autom. Softw. Eng., 2010

2009
The challenges of non-linear parameters and variables in automatic loop parallelisation.
PhD thesis, 2009

Feature (De)composition in Functional Programming.
Proceedings of the Software Composition - 8th International Conference, 2009

Precise Management of Scratchpad Memories for Localising Array Accesses in Scientific Codes.
Proceedings of the Compiler Construction, 18th International Conference, 2009

2008
On Computing Solutions of Linear Diophantine Equations with One Non-linear Parameter.
Proceedings of the SYNASC 2008, 2008

2007
Some Experiments on Tiling Loop Programs for Shared-Memory Multicore Architectures.
Proceedings of the Programming Models for Ubiquitous Parallelism, 02.09. - 07.09.2007, 2007

2006
Quantifier elimination in automatic loop parallelization.
J. Symb. Comput., 2006

2002
Forward Communication Only Placements and Their Use for Parallel Program Construction.
Proceedings of the Languages and Compilers for Parallel Computing, 15th Workshop, 2002


  Loading...