Suivre
Philippe Clauss
Philippe Clauss
INRIA, ICube Lab., CNRS, University of Strasbourg
Adresse e-mail validée de inria.fr
Titre
Citée par
Citée par
Année
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
2311996
Parametric analysis of polyhedral iteration spaces
P Clauss, V Loechner
Journal of VLSI signal processing systems for signal, image and video …, 1998
2121998
Precise data locality optimization of nested loops
V Loechner, B Meister, P Clauss
The journal of Supercomputing 21, 37-76, 2002
932002
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
752012
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
691992
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
682008
Dynamic and speculative polyhedral parallelization using compiler-generated skeletons
A Jimborean, P Clauss, JF Dollinger, V Loechner, JM Martinez Caamaño
International Journal of Parallel Programming 42, 529-545, 2014
652014
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
622000
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
552009
VMAD: an advanced dynamic program analysis and instrumentation framework
A Jimborean, L Mastrangelo, V Loechner, P Clauss
Compiler Construction: 21st International Conference, CC 2012, Held as Part …, 2012
402012
Handling memory cache policy with integer points countings
P Clauss
Euro-Par'97 Parallel Processing: Third International Euro-Par Conference …, 1997
381997
The polyhedral model of nonlinear loops
A Sukumaran-Rajam, P Clauss
ACM Transactions on Architecture and Code Optimization (TACO) 12 (4), 1-27, 2015
372015
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
342017
A symbolic approach to bernstein expansion for program analysis and optimization
P Clauss, I Tchoupaeva
International Conference on Compiler Construction, 120-133, 2004
342004
Efficient parallel implementation of evolutionary algorithms on GPGPU cards
O Maitre, N Lachiche, P Clauss, L Baumes, A Corma, P Collet
Euro-Par 2009 Parallel Processing: 15th International Euro-Par Conference …, 2009
332009
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
331997
Polyhedral parallelization of binary code
B Pradelle, A Ketterlin, P Clauss
ACM Transactions on Architecture and Code Optimization (TACO) 8 (4), 1-21, 2012
312012
Geometrical tools to map systems of affine recurrence equations on regular arrays
C Mongenet, P Clauss, GR Perrin
Acta Informatica 31, 137-160, 1994
311994
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
282007
Padrone: a platform for online profiling, analysis, and optimization
E Riou, E Rohou, P Clauss, N Hallou, A Ketterlin
DCE 2014-International workshop on Dynamic Compilation Everywhere, 2014
252014
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20