[Journals] [Books] [International Conferences] [National Conferences] [Doctorate] [Research Reports]

• Philippe Clauss, Imen Fassi and Alexandra Jimborean,  Software-controlled Processor Stalls for Time and Energy Efficient Data Locality Optimization, International Conference on Embedded Computer Systems: Architectures, Modeling and Simulation – SAMOS XIV, Jul 2014, Agios Konstantinos, Greece.

• Jimborean, Alexandra and Clauss, Philippe and Martinez, Juan Manuel and Sukumaran-Rajam, Aravind,  Online Dynamic Dependence Analysis for Speculative Polyhedral Parallelization, Euro-Par 2013 Parallel Processing. Springer Berlin Heidelberg, Lecture Notes in Computer Science 8097, pp. 191-202, 2013.

• Imen Fassi, Philippe Clauss, Matthieu Kuhn and Yosr Slama,  Multifor for Multicore, IMPACT 2013, Third International Workshop on Polyhedral Compilation Techniques, Jan 2013, Berlin, Germany. Epubli, Proceedings of the 3rd International Workshop on Polyhedral Compilation Techniques, pp. 37-44.

• Alain Ketterlin and Philippe Clauss,  Profiling Data-Dependence to Assist Parallelization: Framework, Scope, and Optimization, MICRO-45, The 45th Annual IEEE/ACM International Symposium on Microarchitecture, Dec 2012, Vancouver, Canada.

• Alexandra Jimborean, Luis Mastrangelo, Vincent Loechner and Philippe Clauss,  VMAD: an Advanced Dynamic Program Analysis & Instrumentation Framework, CC - 21st International Conference on Compiler Construction, Mar 2012, Tallinn, Estonia. Springer, Lecture Notes in Computer Science 7210, pp. 220-237, 2012.

• Alexandra Jimborean, Philippe Clauss, Benoit Pradelle, Luis Mastrangelo and Vincent Loechner, Adapting the Polyhedral Model as a Framework for Efficient Speculative Parallelization, PPoPP - 17th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Feb 2012, New Orleans, USA, 2012.

• Philippe Clauss and Alexandra Jimborean, Does dynamic and speculative parallelization enable advanced parallelizing and optimizing code transformations? DCE - 1st International Workshop on Dynamic compilation from SoC to Web Browser via HPC, in conjonction with HiPEAC 2012, Jan 2012, Paris, France.

• Benoît Pradelle, Philippe Clauss and Vincent Loechner, Adaptive Runtime Selection of Parallel Schedules in the Polytope Model, 19th High Performance Computing Symposium, ACM/SIGSIM, Boston, MA, USA, April 3-7, 2011.

• Alain Ketterlin and Philippe Clauss, Efficient Memory Tracing by Program Skeletonization, IEEE International Symposium on Performance Analysis of Systems and Software, ISPASS, Austin, Texas, USA, April 10-12, 2011. (24/64 - 37%)

• Alexandra Jimborean, Matthieu Herrmann, Vincent Loechner and Philippe Clauss, VMAD: a Virtual Machine for Advanced Dynamic Analysis of Programs, IEEE International Symposium on Performance Analysis of Systems and Software, ISPASS, Austin, Texax, USA, April 10-12, 2011. (24/64 - 37%)

• Alain Ketterlin and Philippe Clauss, Recovering the Memory Behavior of Executable Programs, 10th IEEE Working Conference on Source Code Analysis and Manipulation, SCAM10, Timisoara, Romania, September 12-13, 2010. (17/44 - 38.6%)
  

• Ogier Maitre, Nicolas Lachiche, Philippe Clauss, Laurent Baumes, Avelino Corma and Pierre Collet, Efficient Parallel Implementation of Evolutionary Algorithms on GPGPU Cards, Euro-Par 2009, Delft, The Netherlands, August 2009. (85/257 - 33%)

• Jean Christophe Beyler, Michael Klemm, Michael Philippsen and Philippe Clauss, Automatic Prefetching with Binary Code Rewriting in Object-based DSMs,  Europar 2008, Las Palmas de Gran Canaria (Spain), August 2008. (89/264 - 33%) - selected as one of the three best papers presented in a special session.

• Alain Ketterlin and Philippe Clauss, Prediction and Trace Compression of Data Access Addresses through Nested Loops Recognition, IEEE/ACM International Symposium on Code Generation and Optimization 2008, CGO 2008, Boston, Massachusetts, USA, April 6 - 9, 2008.

• Michael KLEMM, Jean Christophe BEYLER, Ronny T. LAMPERT, Michael PHILIPPSEN and Philippe CLAUSS, Esodyp+: Prefetching in the Jackal Software DSM, Euro-Par 2007, Rennes, France, August 2007. (89/333 - 27%)

• Jean-Christophe Beyler and Philippe Clauss, Performance Driven Data Cache Prefetching in a Dynamic Software Optimization System, 21st ACM International Conference on Supercomputing, ICS'07, Seattle, WA, USA, June 2007. (29/125 - 23%)

• Philippe Clauss and Bénédicte Kenmei, Polyhedral Modeling and Analysis of Memory Access Profiles, IEEE 17th International Conference on Application-specific Systems, Architectures and Processors, ASAP 2006, IEEE Computer Society, pages 191-198,ISBN:1063-6862, Steamboat Springs, Colorado, September 2006.

• Jean Christophe Beyler and Philippe Clauss, ESODYP: An Entirely Software and Dynamic Data Prefetcher based on a Markov Model, Proceedings of the 12th Workshop on Compilers for Parallel Computers, CPC 2006, University of A Coruna, pages 118-132,ISBN:54-609-8459-1, A Coruna, Spain, January 2006.

• Ph. Clauss, B. Kenmei and J.C. Beyler, The Periodic-Linear Model of Program Behavior Capture, 11th ACM/IEEE Int. Euro-Par Conference, Lisbon, Portugal, 2005, LNCS 3648, pages 325-335, Springer, august-september, 2005, Lisboa, Portugal. (31.2%)

• 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. (19/58 - 33%)

• Ph. Clauss, Bénéicte 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.

• V. Loechner, B. Meister and Ph. Clauss, Data Sequence Locality: a Generalization of Temporal Locality, Europar'2001, Manchester, UK, august 2001.

• 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.

• Ph. Clauss and B. Meister, Automatic Memory Layout Transformation to Optimize Spatial Locality in Parameterized Loop Nests, 4th Annual Workshop on Interaction between Compilers and Computer Architectures, INTERACT-4, Toulouse (France), January 2000.

• 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, Parametric Analysis of Polyhedral Iteration Spaces, IEEE Int. Conf. on Application Specific Array Processors, ASAP'96, Chicago, Illinois, August 1996.

• 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, G.-R. Perrin, Optimal mapping of systolic algorithms by regular instruction shifts, Int. Conf. on Application-Specific Array Processors, ASAP'94, pages 224-235, San Francisco, California, IEEE Computer Society Press.

• Ph. Clauss, An efficient allocation strategy for mapping affine recurrences into space and time optimal regular processor arrays, In C. Jesshope, V. Jossifov and W. Wilhelmi editors, Int. Conf. PARCELLA'94, pages 257-266, Potsdam, Germany, Sept. 1994, Akademie Verlag.

• Ph. Clauss, C. Mongenet, G.-R. Perrin, Synthesis of size-optimal toroidal arrays for the Algebraic Path Problem, Int. workshop "Algorithms and Parallel VLSI Architectures II", Bonas, juin 1991, North-Holland Pub.

• C. Mongenet, Ph. Clauss, G.-R. Perrin, A geometrical coding to compile affine recurrences equations, 5th Int. Parallel Symposium, mai 1991, IEEE Computer Society Press.

• Ph. Clauss, Mapping systolic algorithms on Distributed Memory Computers, EDMCC2, Munich, avril 1991, LNCS no. 487, Spinger Verlag.

• Ph. Clauss, C. Mongenet, G.-R. Perrin, Calculus of space-optimal mappings of systolic algorithms on processor arrays, In S.Y. Kung and E. Swartzlander editors, International Conference on Application-Specific Array Processors, pages 4-18, Princeton, New Jersey, Sept. 1990, IEEE Computer Society Press.

• G.-R. Perrin, Ph. Clauss, S. Damy, Mapping Programs on Regular Distributed Architectures, 1er colloque europ�en sur les hypercubes et les calculateurs distribu�s, Rennes, Hypercube and distributed Computers, North-Holland 1989.

• Ph. Clauss, G.-R. Perrin, Synthesis of process arrays, CONPAR'88, Manchester, sept. 1988, Cambridge University Press.

• Ph. Clauss, C. Mongenet, G.-R. Perrin, Synthesis of efficient systolic arrays for matrix algebra problems, International Symposium on High Performance Computer Systems, Paris, d�cembre 1987, North-Holland Pub.

• Alexandra Jimborean, Philippe Clauss, Jean-François Dollinger, Vincent Loechner and Juan Manuel Martinez Caamaño, Dynamic and Speculative Polyhedral Parallelization Using Compiler-Generated Skeletons, International Journal of Parallel Programming 42(4):529-545 (2014).

• Alain Ketterlin, Philippe Clauss, Recovering memory access patterns of executable programs, Science of Computer Programming 80:440-456 (2014).

• Benoît Pradelle, Alain Ketterlin and Philippe Clauss, Polyhedral parallelization of binary code, ACM Transactions on Architecture and Code Optimization, ACM Press, 2012, Special issue on high-performance and embedded architectures and compilers, 8 (4), pp. 39:1-39:21.

• Philippe Clauss, Federico Javier Fernandez, Diego Gabervetsky and Sven Verdoolaege, Symbolic Polynomial Maximization over Convex Sets and its Application to Memory Requirement Estimation, IEEE Transactions on Very Large Scale Integration (VLSI) Systems, Volume 17, Issue 8, pages 983-996, August 2009.

• Jean Christophe Beyler, Michael Klemm, Philippe Clauss and Michael Philippsen, A Meta-predictor Framework for Prefetching in Object-based DSMs, Concurrency and Computation: Practice and Experience, John Wiley and Sons Ltd, accepted for publication, 2009.

• 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.

• 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 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.

• Ph. Clauss and V. Loechner, Parametric Analysis of Polyhedral Iteration Spaces, extended version, Journal of VLSI Signal Processing, Vol. 19, No. 2, p. 179-194, Kluwer Academic Pub., July 1998.

• C. Mongenet, Ph. Clauss, G.-R. Perrin, Geometrical Tools to map Systems of Affine Recurrence Equations on Regular Arrays, Acta Informatica 31, 137-160 (1994).

• Ph. Clauss, C. Mongenet, Synthesis aspects in the design of efficient processor arrays from affine recurrence equations, Journal of Symbolic Computation 15, 547-569, Academic Press (1993).

• Ph. Clauss, C. Mongenet, G.-R. Perrin, Synthesis of size-optimal toroidal arrays for the Algebraic Path Problem : A new contribution, Parallel Computing, 18 (1992).

• Ph. Clauss, C. Mongenet, G.-R. Perrin, Calculus of space-optimal mappings of systolic algorithms on processor arrays, Journal of VLSI Signal Processing, 4, pages 27-36 (1992).

• Philippe Clauss, Federico Javier Fernandez, Diego Gabervetsky and Sven Verdoolaege, Symbolic Polynomial Maximization over Convex Sets and its Application to Memory Requirement Estimation,
  [ICPS RR 06-04], October 2006.

• B. Meister, V. Loechner and Ph. Clauss, The Polytope Model for Optimizing Cache Locality,
  [ICPS RR 00-03], May 2000.

• Ph. Clauss and B. Meister, Automatic Memory Layout Transformations to Optimize Spatial Locality in Parameterized Loop Nests,
  [ICPS RR 99-02], August 1999.

• Ph. Clauss, Advances in parameterized linear diophantine equations for precise program analysis,
  [ICPS RR 98-02], September 1998.

• Ph. Clauss, Sur les extensions et les utilisations en Informatique d'un r�sultat Math�matique : Les polyn�mes d'Ehrhart, article de vulgarisation, Bulletin de l'APMEP (Association Fran�aise des Professeurs de Math�matiques de l'Enseignement Public), num�ros 418 et 419, septembre et octobre 1998.

• 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-01, April 1997.

• Ph. Clauss, Handling Memory Cache Policy with Integer Points Countings (extended version), research report ICPS 97-02, january 1997.

• 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, C. Mongenet, G.-R. Perrin, Implantations optimales d'�quations r�currentes affines, Algorithmique parall�le, collection �tudes et recherches en informatique, Masson 1992.

• Ph. Clauss, Sur le d�nombrement des solutions d'un syst�me lin�aire en nombres entiers param�trique, pr�sentation aux "Rencontres sur les probl�mes lin�aires en nombres entiers, PLNE'96", INRIA Rocquencourt, 28-30 octobre 1996. transparents R�sum�

• Ph. Clauss, Les poly�dres d'Ehrhart pour l'analyse et la transformation de programmes, pr�sentation � la journ�e PRS "Parall�lisme de donn�es", ENS Lyon, janvier 1996.

• Ph. Clauss, D�termination syst�matique d'implantations optimales en place d'algorithmes systoliques sur r�seaux de processeurs synchrones, Rencontres C3, Rennes, juillet 1990.

• G.-R. Perrin, Ph. Clauss, S. Damy, Parall�lisation d'�quations r�currentes, Journ�es C3 - greco Programmation : d�veloppement de programmes pour machines parall�les, Chamonix, mai 1989, actes publi�s dans Bigre no. 66.

• Ph. Clauss, C. Mongenet, G.-R. Perrin, Synth�se de r�seaux systoliques h�t�rog�nes avec SYSTOL, Journ�es Architectures C3, Sophia-Antipolis, juillet 1987, publi� dans Bigre no. 56.

• Ph. Clauss, M�thodes poly�driques pour la parall�lisation et l'optimisation de programmes, Habilitation � diriger des recherches de l'Universit� Louis Pasteur, Strasbourg, 14 janvier 2000.

• Ph. Clauss, Synth�se d'algorithmes systoliques et implantation optimale en place sur r�seaux de processeurs synchrones, Th�se de l'Universit� de Franche-Comt�, Besan�on, Mai 1990.

BACK