Members
Overall Objectives
Research Program
Application Domains
Software and Platforms
New Results
Bilateral Contracts and Grants with Industry
Partnerships and Cooperations
Dissemination
Bibliography
XML PDF e-pub
PDF e-Pub


Bibliography

Major publications by the team in recent years
[1]
J. C. Beyler, P. Clauss.
Performance driven data cache prefetching in a dynamic software optimization system, in: ICS '07: Proceedings of the 21st annual international conference on Supercomputing, New York, NY, USA, ACM, 2007, pp. 202–209.
http://doi.acm.org/10.1145/1274971.1275000
[2]
J. C. Beyler, M. Klemm, P. Clauss, M. Philippsen.
A meta-predictor framework for prefetching in object-based DSMs, in: Concurr. Comput. : Pract. Exper., September 2009, vol. 21, pp. 1789–1803.
[3]
P. Clauss.
Counting solutions to linear and nonlinear constraints through Ehrhart polynomials: applications to analyze and transform scientific programs, in: ICS '96: Proceedings of the 10th international conference on Supercomputing, New York, NY, USA, ACM, 1996, pp. 278–285.
http://doi.acm.org/10.1145/237578.237617
[4]
P. Clauss, F. J. Fernández, D. Garbervetsky, S. Verdoolaege.
Symbolic polynomial maximization over convex sets and its application to memory requirement estimation, in: IEEE Transactions on Very Large Scale Integration (VLSI) Systems, Aug 2009, vol. 17, no 8, pp. 983-996.
http://hal.inria.fr/inria-00504617
[5]
P. Clauss, V. Loechner.
Parametric Analysis of Polyhedral Iteration Spaces, in: J. VLSI Signal Process. Syst., 1998, vol. 19, no 2, pp. 179–194.
http://dx.doi.org/10.1023/A:1008069920230
[6]
P. Clauss, I. Tchoupaeva.
A Symbolic Approach to Bernstein Expansion for Program Analysis and Optimization, LNCS, Springer, April 2004, vol. 2985, pp. 120-133.
[7]
A. Ketterlin, P. Clauss.
Prediction and trace compression of data access addresses through nested loop recognition, in: 6th annual IEEE/ACM international symposium on Code generation and optimization, États-Unis Boston, ACM, April 2008, pp. 94-103.
http://dx.doi.org/10.1145/1356058.1356071, http://hal.inria.fr/inria-00504597/en
[8]
V. Loechner, B. Meister, P. Clauss.
Precise data locality optimization of nested loops, in: Journal of Supercomputing, January 2002, vol. 21, no 1, pp. 37–76, Kluwer Academic Pub..
[9]
V. Loechner, D. K. Wilde.
Parameterized Polyhedra and their Vertices, in: International Journal of Parallel Programming, December 1997, vol. 25, no 6.
[10]
S. Verdoolaege, R. Seghir, K. Beyls, V. Loechner, M. Bruynooghe.
Counting Integer Points in Parametric Polytopes Using Barvinok's Rational Functions, in: Algorithmica, 2007, vol. 48, no 1, pp. 37–66.
http://dx.doi.org/10.1007/s00453-006-1231-0
[11]
É. Violard.
A Semantic Framework to Address Data Locality in Data Parallel Languages, in: Parallel Computing, 2004, vol. 30, no 1, pp. 139-161.
Publications of the year

Articles in International Peer-Reviewed Journals

[12]
A. Ketterlin, P. Clauss.
Recovering memory access patterns of executable programs, in: Science of Computer Programming, February 2014, vol. 80, pp. 440-456. [ DOI : 10.1016/j.scico.2012.08.002 ]
http://hal.inria.fr/hal-00909961
[13]
E. Park, J. Cavazos, L.-N. Pouchet, C. Bastoul, A. Cohen, P. Sadayappan.
Predictive Modeling in a Polyhedral Optimization Space, in: International Journal of Parallel Programming, 2013, vol. 41, no 5, pp. 704–750. [ DOI : 10.1007/s10766-013-0241-1 ]
http://hal.inria.fr/hal-00918653

International Conferences with Proceedings

[14]
J.-F. Dollinger, V. Loechner.
Adaptive Runtime Selection for GPU, in: 42nd International Conference on Parallel Processing, Lyon, France, IEEE, October 2013, pp. 70-79. [ DOI : 10.1109/ICPP.2013.16 ]
http://hal.inria.fr/hal-00869652
[15]
I. Fassi, P. Clauss, M. Kuhn, Y. Slama.
Multifor for Multicore, in: IMPACT 2013, Third International Workshop on Polyhedral Compilation Techniques, Berlin, Germany, A. Grösslinger, L.-N. Pouchet (editors), Epubli, January 2013, pp. 37-44.
http://hal.inria.fr/hal-00780748
[16]
P. Feautrier, E. Violard, A. Ketterlin.
Improving X10 Program Performances by Clock Removal, in: Compiler Construction 2014, Grenoble, France, January 2014.
http://hal.inria.fr/hal-00924206
[17]
A. Jimborean, P. Clauss, J.-F. Dollinger, V. Loechner, J. M. Martinez.
Dynamic and Speculative Polyhedral Parallelization Using Compiler-Generated Skeletons, in: International Symposium on High-level Parallel Programming and Applications‎, HLPP, Paris, France, July 2013.
http://hal.inria.fr/hal-00825738
[18]
A. Jimborean, P. Clauss, J. M. Martinez, A. Sukumaran-Rajam.
Online Dynamic Dependence Analysis for Speculative Polyhedral Parallelization, in: Euro-Par 2013, Aachen, Germany, F. Wolf, B. Mohr, D. an Mey (editors), Lecture Notes in Computer Science, Springer, August 2013, vol. 8097, pp. 191-202. [ DOI : 10.1007/978-3-642-40047-6_21 ]
http://hal.inria.fr/hal-00825744
[19]
E. Riou, E. Rohou, P. Clauss, N. Hallou, A. Ketterlin.
PADRONE: a Platform for Online Profiling, Analysis, and Optimization, in: DCE 2014 - International workshop on Dynamic Compilation Everywhere, Vienne, Austria, January 2014.
http://hal.inria.fr/hal-00917950

Scientific Popularization

[20]
J. Narboux.
Les assistants de preuve, ou comment avoir confiance en ses démonstrations, in: Séminaire L, Strasbourg, France, March 2013.
http://hal.inria.fr/hal-00809448
References in notes
[21]
C. Bastoul.
Code Generation in the Polyhedral Model Is Easier Than You Think, in: PACT'13 IEEE International Conference on Parallel Architecture and Compilation Techniques, Juan-les-Pins, France, 2004, pp. 7–16.
http://hal.ccsd.cnrs.fr/ccsd-00017260
[22]
P. Clauss, A. Jimborean.
Does dynamic and speculative parallelization enable advanced parallelizing and optimizing code transformations?, in: DCE - 1st International Workshop on Dynamic compilation from SoC to Web Browser via HPC, in conjonction with HiPEAC 2012, Paris, France, Henri-Pierre Charles and Philippe Clauss and Frédéric Pétrot, January 2012.
http://hal.inria.fr/hal-00664339
[23]
M. Hall, D. Padua, K. Pingali.
Compiler research: the next 50 years, in: Commun. ACM, 2009, vol. 52, no 2, pp. 60–67.
http://doi.acm.org/10.1145/1461928.1461946
[24]
A. Hobor, A. W. Appel, F. Z. Nardelli.
Oracle Semantics for Concurrent Separation Logic, in: ESOP, 2008, pp. 353-367.
[25]
A. Jimborean.
Adapting the polytope model for dynamic and speculative parallelization, Université de Strasbourg, September 2012.
http://tel.archives-ouvertes.fr/tel-00733850
[26]
A. Jimborean, L. Mastrangelo, V. Loechner, P. Clauss.
VMAD: an Advanced Dynamic Program Analysis & Instrumentation Framework, in: CC - 21st International Conference on Compiler Construction, Tallinn, Estonia, M. F. P. O'Boyle (editor), Lecture Notes in Computer Science, Springer, March 2012, vol. 7210, pp. 220-237.
http://hal.inria.fr/hal-00664345
[27]
A. Ketterlin, P. Clauss.
Recovering the Memory Behavior of Executable Programs, in: 10th IEEE Working Conference on Source Code Analysis and Manipulation, SCAM, Roumanie Timisoara, IEEE Computer Society Press, Sep 2010.
http://hal.inria.fr/inria-00502813
[28]
X. Leroy.
The Compcert verified compiler, software and commented proof, January 2010.
http://compcert.inria.fr
[29]
R. Seghir, V. Loechner, B. Meister.
Integer Affine Transformations of Parametric Z-polytopes and Applications to Loop Nest Optimization, in: ACM Transactions on Architecture and Code Optimization, June 2012, vol. 9, no 2, pp. 8.1-8.27. [ DOI : 10.1145/2207222.2207224 ]
http://hal.inria.fr/inria-00582388