PCO: Proposition de sujets de projets

Publications

V. Loechner, D. K. Wilde, Parameterized polyhedra and their vertices, International Journal of Parallel Programming (Vol. 25, No. 6, Dec. 1997 issue).
Ph. Clauss and V. Loechner, Parametric Analysis of Polyhedral Iteration Spaces, Journal of VLSI Signal Processing, Vol. 19, No. 2, p. 179-194, Kluwer Academic Pub., July 1998.
Ph. Clauss and B. Meister, Automatic Memory Layout Transformation to Optimize Spatial Locality in Parameterized Loop Nests, ACM SIGARCH Computer Architecture News, Vol. 28, No. 1, March 2000.
V. Loechner, B. Meister and Ph. Clauss, Precise data locality optimization of nested loops. The Journal of Supercomputing, Volume 21, Number 1, pp. 37-76, January 2002, Kluwer Academic Pub., 2002.
Ph. Clauss and I. Tchoupaeva A Symbolic Approach To Bernstein Expansion (in russian), in Programmirovanie (Programming and Computer Software), Vol. 30, No. 3, 2004, Russian Academy of Sciences, Nauka, Moscow.

Ph. Clauss, B. Kenmei and J.C. Beyler, The Periodic-Linear Model of Program Behavior Capture, Euro-Par 2005, LNCS 3648, pages 325-335, Springer, Lisboa, Portugal, September 2005.
Sven Verdoolaege, Rachid Seghir, Kristof Beyls, Vincent Loechner and Maurice Bruynooghe, Analytical computation of Ehrhart polynomials: enabling more compiler analyses and optimizations, Proceedings of International Conference on Compilers, Architectures, and Synthesis for Embedded Systems, CASES 2004, pages 248--258, Washington D.C., September 2004.
Ph. Clauss and Irina Tchoupaeva, A Symbolic Approach to Bernstein Expansion for Program Analysis and Optimization, 13th International Conference on Compiler Construction, CC 2004, LNCS 2985, pp 120-133, Springer, April 2004, Barcelona, Spain.
Sven Verdoolaege, Kristof Beyls, Maurice Bruynooghe, Rachid Seghir and Vincent Loechner, Analytical Computation of Ehrhart Polynomials and its Applications for Embedded Systems, Workshop on Optimizations for DSP and Embedded Systems, in conjunction with IEEE/ACM International Symposium on Code Generation, Palo Alto, california, March 2004.
Ph. Clauss and I. Tchoupaeva A Symbolic Approach To Bernstein Expansion (in russian), in Programmirovanie (Programming and Computer Software), Vol. 30, No. 3, 2004, Russian Academy of Sciences, Nauka, Moscow.
Benoît Meister, Periodic Polyhedra, 13th International Conference on Compiler Construction, CC 2004, Barcelona, Spain, April 2004.
Ph. Clauss, Counting Solutions to Linear and Nonlinear Constraints through Ehrhart polynomials: Applications to Analyze and Transform Scientific Programs, 10th ACM Int. Conf. on Supercomputing, ICS'96, May 1996.
Ph. Clauss, Handling Memory Cache Policy with Integer Points Countings, Euro-Par'97, Passau, August 1997, LNCS 1300, p. 285-293.
Ph. Clauss, V. Loechner and B. Meister, Minimizing strides in Loops with Affine Array References, CPC'2001, Compilers for Parallel Computers, Edinburgh, Scotland, 27-29 juin 2001.
V. Loechner, B. Meister and Ph. Clauss, Data Sequence Locality: a Generalization of Temporal Locality, Europar'2001, Manchester, UK, august 2001.
B. Meister, Localité de données dans les opérations stencil, RenPar'2001, Cité des Sciences et de l'Industrie, Paris, avril 2001.
Ph. Clauss, Bénédicte Kenmei Youta and Odile Rousselet, Modeling Program Traces with Nested Loops, Workshop on Exploring the Trace Space for Dynamic Optimization Techniques, held in conjunction with ICS'03, San Francisco, USA, june 2003.
Benoît Meister, Periodic Polyhedra, 13th International Conference on Compiler Construction, CC 2004, Barcelona, Spain, April 2004.
Ph. Clauss and Irina Tchoupaeva, A Symbolic Approach to Bernstein Expansion for Program Analysis and Optimization, 13th International Conference on Compiler Construction, CC 2004, LNCS 2985, pp 120-133, Springer, April 2004, Barcelona, Spain.

Ph. Clauss, The Volume of a Lattice Polyhedron to Enumerate Processors and Parallelism, research report ICPS 95-11. Here is a more math version of this paper.
Ph. Clauss, V. Loechner and D.K. Wilde, Deriving Formulae to Count Solutions to Parameterized Linear Systems using Ehrhart Polynomials: Applications to the Analysis of Nested-Loop Programs, ICPS RR 97-05, April 1997.
Ph. Clauss, Advances in parameterized linear diophantine equations for precise program analysis, [ICPS RR 98-02], September 1998.
Rachid Seghir, Sven Verdoolaege, Kristof Beyls, and Vincent Loechner, Analytical Computation of Ehrhart Polynomials and its Application in Compile-Time Generated Cache Hints, ICPS Research report, February 2004.
Jean Christophe Beyler and Philippe Clauss, ESODYP: An Entirely Software and Dynamic Data Prefetcher based on a Memory Strides Markov Model, Research report ICPS/LSIIT, june 2004.