Philippe Clauss

According to our database1, Philippe Clauss authored at least 50 papers between 1991 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.



In proceedings 
PhD thesis 




Runtime multi-versioning and specialization inside a memoized speculative loop optimizer.
Proceedings of the CC '20: 29th International Conference on Compiler Construction, 2020

AutoParallel: A Python module for automatic parallelization and distributed execution of affine loop nests.
CoRR, 2018

Runtime Vectorization Transformations of Binary Code.
Int. J. Parallel Program., 2017

Full runtime polyhedral optimizing loop transformations with the generation, instantiation, and scheduling of code-bones.
Concurr. Comput. Pract. Exp., 2017

Automatic Collapsing of Non-Rectangular Loops.
Proceedings of the 2017 IEEE International Parallel and Distributed Processing Symposium, 2017

The Polyhedral Model of Nonlinear Loops.
TACO, 2016

Code Bones: Fast and Flexible Code Generation for Dynamic and Speculative Polyhedral Optimization.
Proceedings of the Euro-Par 2016: Parallel Processing, 2016

Dynamic re-vectorization of binary code.
Proceedings of the 2015 International Conference on Embedded Computer Systems: Architectures, 2015

XFOR: Filling the Gap between Automatic Loop Optimization and Peak Performance.
Proceedings of the 14th International Symposium on Parallel and Distributed Computing, 2015

Speculative Runtime Parallelization of Loop Nests: Towards Greater Scope and Efficiency.
Proceedings of the 2015 IEEE International Parallel and Distributed Processing Symposium Workshop, 2015

Recovering memory access patterns of executable programs.
Sci. Comput. Program., 2014

Dynamic and Speculative Polyhedral Parallelization Using Compiler-Generated Skeletons.
Int. J. Parallel Program., 2014

Software-controlled processor stalls for time and energy efficient data locality optimization.
Proceedings of the XIVth International Conference on Embedded Computer Systems: Architectures, 2014

Speculative Program Parallelization with Scalable and Decentralized Runtime Verification.
Proceedings of the Runtime Verification - 5th International Conference, 2014

Author retrospective for counting solutions to linear and nonlinear constraints through ehrhart polynomials: applications to analyze and transform scientific programs.
Proceedings of the ACM International Conference on Supercomputing 25th Anniversary Volume, 2014

Dynamic and Speculative Polyhedral Parallelization of Loop Nests Using Binary Code Patterns.
Proceedings of the International Conference on Computational Science, 2013

Online Dynamic Dependence Analysis for Speculative Polyhedral Parallelization.
Proceedings of the Euro-Par 2013 Parallel Processing, 2013

Polyhedral parallelization of binary code.
TACO, 2012

Adapting the polyhedral model as a framework for efficient speculative parallelization.
Proceedings of the 17th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2012

Profiling Data-Dependence to Assist Parallelization: Framework, Scope, and Optimization.
Proceedings of the 45th Annual IEEE/ACM International Symposium on Microarchitecture, 2012

VMAD: An Advanced Dynamic Program Analysis and Instrumentation Framework.
Proceedings of the Compiler Construction - 21st International Conference, 2012

Adaptive runtime selection of parallel schedules in the polytope model.
Proceedings of the 2011 Spring Simulation Multi-conference, 2011

Efficient memory tracing by program skeletonization.
Proceedings of the IEEE International Symposium on Performance Analysis of Systems and Software, 2011

VMAD: A virtual machine for advanced dynamic analysis of programs.
Proceedings of the IEEE International Symposium on Performance Analysis of Systems and Software, 2011

Recovering the Memory Behavior of Executable Programs.
Proceedings of the Tenth IEEE International Working Conference on Source Code Analysis and Manipulation, 2010

Symbolic Polynomial Maximization Over Convex Sets and Its Application to Memory Requirement Estimation.
IEEE Trans. Very Large Scale Integr. Syst., 2009

A meta-predictor framework for prefetching in object-based DSMs.
Concurr. Comput. Pract. Exp., 2009

Efficient Parallel Implementation of Evolutionary Algorithms on GPGPU Cards.
Proceedings of the Euro-Par 2009 Parallel Processing, 2009

Automatic Prefetching with Binary Code Rewriting in Object-Based DSMs.
Proceedings of the Euro-Par 2008, 2008

Prediction and trace compression of data access addresses through nested loop recognition.
Proceedings of the Sixth International Symposium on Code Generation and Optimization (CGO 2008), 2008

Performance driven data cache prefetching in a dynamic software optimization system.
Proceedings of the 21th Annual International Conference on Supercomputing, 2007

Esodyp+: Prefetching in the Jackal Software DSM.
Proceedings of the Euro-Par 2007, 2007

Polyhedral Modeling and Analysis of Memory Access Profiles.
Proceedings of the 2006 IEEE International Conference on Application-Specific Systems, 2006

The Periodic-Linear Model of Program Behavior Capture.
Proceedings of the Euro-Par 2005, Parallel Processing, 11th International Euro-Par Conference, Lisbon, Portugal, August 30, 2005

A Symbolic Approach to Bernstein Expansion for Program Analysis and Optimization.
Proceedings of the Compiler Construction, 13th International Conference, 2004

Precise Data Locality Optimization of Nested Loops.
J. Supercomput., 2002

Data Sequence Locality: A Generalization of Temporal Locality.
Proceedings of the Euro-Par 2001: Parallel Processing, 2001

Automatic memory layout transformations to optimize spatial locality in parameterized loop nests.
SIGARCH Comput. Archit. News, 2000

Parametric Analysis of Polyhedral Iteration Spaces.
J. VLSI Signal Process., 1998

Handling Memory Cache Policy with Integer Points Counting.
Proceedings of the Euro-Par '97 Parallel Processing, 1997

Counting Solutions to Linear and Nonlinear Constraints Through Ehrhart Polynomials: Applications to Analyze and Transform Scientific Programs.
Proceedings of the 10th international conference on Supercomputing, 1996

Geometrical Tools to Map Systems of Affine Recurrence Equations on Regular Arrays.
Acta Informatica, 1994

An Efficient Allocation Strategy for Mapping Affine Recurrences into Space and Time Optimal Regular Processor Arrays.
Proceedings of the Parcella 1994, 1994

Optimal mapping of systolic algorithms by regular instruction shifts.
Proceedings of the International Conference on Application Specific Array Processors, 1994

Synthesis Aspects in the Design of Efficient Processor Arrays from Affine Recurrence Equations.
J. Symb. Comput., 1993

Calculus of space-optimal mappings of systolic algorithms on processor arrays.
J. VLSI Signal Process., 1992

Synthesis of size-optimal toroidal arrays for the Algebraic Path Problem: A new contribution.
Parallel Comput., 1992

A Geometrical Coding to Compile Affine Recurrence Equations on Regular Arrays.
Proceedings of the Fifth International Parallel Processing Symposium, Proceedings, Anaheim, California, USA, April 30, 1991

Mapping Systolic Algorithms on Distributed Memory Computers.
Proceedings of the Distributed Memory Computing, 2nd Euronean Conference, 1991

Synthesis of size-optimal toroidal arrays for the algebraic path problem.
Proceedings of the Algorithms and Parallel VLSI Architectures II, 1991