Philippe Clauss
Philippe Clauss
INRIA, ICube Lab., CNRS, University of Strasbourg
Verified email at
Cited by
Cited by
Counting solutions to linear and nonlinear constraints through Ehrhart polynomials: Applications to analyze and transform scientific programs
P Clauss
Proceedings of the 10th international conference on Supercomputing, 278-285, 1996
Parametric analysis of polyhedral iteration spaces
P Clauss, V Loechner
Journal of VLSI signal processing systems for signal, image and video …, 1998
Precise data locality optimization of nested loops
V Loechner, B Meister, P Clauss
The journal of Supercomputing 21 (1), 37-76, 2002
Profiling data-dependence to assist parallelization: Framework, scope, and optimization
A Ketterlin, P Clauss
2012 45th Annual IEEE/ACM International Symposium on Microarchitecture, 437-448, 2012
Calculus of space-optimal mappings of systolic algorithms on processor arrays
P Clauss, C Mongenet, G Perrin
Journal of VLSI signal processing systems for signal, image and video …, 1992
Dynamic and speculative polyhedral parallelization using compiler-generated skeletons
A Jimborean, P Clauss, JF Dollinger, V Loechner, JMM Caamaño
International Journal of Parallel Programming 42 (4), 529-545, 2014
Prediction and trace compression of data access addresses through nested loop recognition
A Ketterlin, P Clauss
Proceedings of the 6th annual IEEE/ACM international symposium on Code …, 2008
Symbolic polynomial maximization over convex sets and its application to memory requirement estimation
P Clauss, FJ Fernández, D Garbervetsky, S Verdoolaege
IEEE transactions on very large scale integration (VLSI) systems 17 (8), 983-996, 2009
Automatic memory layout transformations to optimize spatial locality in parameterized loop nests
P Clauss, B Meister
ACM SIGARCH computer architecture news 28 (1), 11-19, 2000
Handling memory cache policy with integer points countings
P Clauss
European Conference on Parallel Processing, 285-293, 1997
VMAD: an advanced dynamic program analysis and instrumentation framework
A Jimborean, L Mastrangelo, V Loechner, P Clauss
International Conference on Compiler Construction, 220-239, 2012
Geometrical tools to map systems of affine recurrence equations on regular arrays
C Mongenet, P Clauss, GR Perrin
Acta Informatica 31 (2), 137-160, 1994
Polyhedral parallelization of binary code
B Pradelle, A Ketterlin, P Clauss
ACM Transactions on Architecture and Code Optimization (TACO) 8 (4), 1-21, 2012
A symbolic approach to bernstein expansion for program analysis and optimization
P Clauss, I Tchoupaeva
International Conference on Compiler Construction, 120-133, 2004
The polyhedral model of nonlinear loops
A Sukumaran-Rajam, P Clauss
ACM Transactions on Architecture and Code Optimization (TACO) 12 (4), 1-27, 2015
Deriving formulae to count solutions to parameterized linear systems using Ehrhart polynomials: Applications to the analysis of nested-loop programs
P Clauss, V Loechner, D Wilde
ICPS RR, 97-05, 1997
Efficient parallel implementation of evolutionary algorithms on GPGPU cards
O Maitre, N Lachiche, P Clauss, L Baumes, A Corma, P Collet
European Conference on Parallel Processing, 974-985, 2009
Performance driven data cache prefetching in a dynamic software optimization system
JC Beyler, P Clauss
Proceedings of the 21st annual international conference on Supercomputing …, 2007
Full runtime polyhedral optimizing loop transformations with the generation, instantiation, and scheduling of code‐bones
JM Martinez Caamaño, M Selva, P Clauss, A Baloian, W Wolff
Concurrency and Computation: Practice and Experience 29 (15), e4192, 2017
Opening polyhedral compiler's black box
L Bagnères, O Zinenko, S Huot, C Bastoul
Proceedings of the 2016 International Symposium on Code Generation and …, 2016
The system can't perform the operation now. Try again later.
Articles 1–20