default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPhilippe Clauss
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j16]Cristian Ramon-Cortes
, Ramon Amela, Jorge Ejarque, Philippe Clauss, Rosa M. Badia:
AutoParallel: Automatic parallelisation and distributed execution of affine loop nests in Python. Int. J. High Perform. Comput. Appl. 34(6) (2020)- [c37]Raquel Lazcano, Daniel Madroñal, Eduardo Juárez, Philippe Clauss:
Runtime multi-versioning and specialization inside a memoized speculative loop optimizer. CC 2020: 96-107 - [c36]Salwa Kobeissi, Alain Ketterlin, Philippe Clauss:
Rec2Poly: Converting Recursions to Polyhedral Optimized Loops Using an Inspector-Executor Strategy. SAMOS 2020: 96-109
2010 – 2019
- 2018
- [i1]Cristian Ramon-Cortes, Ramon Amela, Jorge Ejarque, Philippe Clauss, Rosa M. Badia:
AutoParallel: A Python module for automatic parallelization and distributed execution of affine loop nests. CoRR abs/1810.11268 (2018) - 2017
- [j15]Juan Manuel Martinez Caamaño, Manuel Selva, Philippe Clauss, Artyom Baloian, Willy Wolff:
Full runtime polyhedral optimizing loop transformations with the generation, instantiation, and scheduling of code-bones. Concurr. Comput. Pract. Exp. 29(15) (2017) - [j14]Nabil Hallou, Erven Rohou, Philippe Clauss:
Runtime Vectorization Transformations of Binary Code. Int. J. Parallel Program. 45(6): 1536-1565 (2017) - [c35]Philippe Clauss, Ervin Altintas, Matthieu Kuhn:
Automatic Collapsing of Non-Rectangular Loops. IPDPS 2017: 778-787 - 2016
- [j13]Aravind Sukumaran-Rajam, Philippe Clauss:
The Polyhedral Model of Nonlinear Loops. ACM Trans. Archit. Code Optim. 12(4): 48:1-48:27 (2016) - [c34]Juan Manuel Martinez Caamaño, Willy Wolff, Philippe Clauss:
Code Bones: Fast and Flexible Code Generation for Dynamic and Speculative Polyhedral Optimization. Euro-Par 2016: 225-237 - 2015
- [c33]Aravind Sukumaran-Rajam, Luis Esteban Campostrini, Juan Manuel Martinez Caamaño, Philippe Clauss:
Speculative Runtime Parallelization of Loop Nests: Towards Greater Scope and Efficiency. IPDPS Workshops 2015: 245-254 - [c32]Imen Fassi, Philippe Clauss:
XFOR: Filling the Gap between Automatic Loop Optimization and Peak Performance. ISPDC 2015: 100-109 - [c31]Nabil Hallou, Erven Rohou, Philippe Clauss, Alain Ketterlin:
Dynamic re-vectorization of binary code. SAMOS 2015: 228-237 - 2014
- [j12]Alexandra Jimborean, Philippe Clauss, Jean-François Dollinger, Vincent Loechner, Juan Manuel Martinez Caamaño:
Dynamic and Speculative Polyhedral Parallelization Using Compiler-Generated Skeletons. Int. J. Parallel Program. 42(4): 529-545 (2014) - [j11]Alain Ketterlin, Philippe Clauss:
Recovering memory access patterns of executable programs. Sci. Comput. Program. 80: 440-456 (2014) - [c30]Philippe Clauss:
Author retrospective for counting solutions to linear and nonlinear constraints through ehrhart polynomials: applications to analyze and transform scientific programs. ICS 25th Anniversary 2014: 37-39 - [c29]Aravind Sukumaran-Rajam, Juan Manuel Martinez Caamaño, Willy Wolff, Alexandra Jimborean, Philippe Clauss:
Speculative Program Parallelization with Scalable and Decentralized Runtime Verification. RV 2014: 124-139 - [c28]Philippe Clauss, Imen Fassi, Alexandra Jimborean:
Software-controlled processor stalls for time and energy efficient data locality optimization. ICSAMOS 2014: 199-206 - 2013
- [c27]Alexandra Jimborean, Philippe Clauss, Juan Manuel Martinez Caamaño, Aravind Sukumaran-Rajam:
Online Dynamic Dependence Analysis for Speculative Polyhedral Parallelization. Euro-Par 2013: 191-202 - [c26]Alexandra Jimborean, Philippe Clauss, Jean-François Dollinger, Vincent Loechner, Juan Manuel Martinez Caamaño:
Dynamic and Speculative Polyhedral Parallelization of Loop Nests Using Binary Code Patterns. ICCS 2013: 2575-2578 - 2012
- [j10]Benoît Pradelle, Alain Ketterlin, Philippe Clauss:
Polyhedral parallelization of binary code. ACM Trans. Archit. Code Optim. 8(4): 39:1-39:21 (2012) - [c25]Alexandra Jimborean, Luis Mastrangelo, Vincent Loechner, Philippe Clauss:
VMAD: An Advanced Dynamic Program Analysis and Instrumentation Framework. CC 2012: 220-239 - [c24]Alain Ketterlin, Philippe Clauss:
Profiling Data-Dependence to Assist Parallelization: Framework, Scope, and Optimization. MICRO 2012: 437-448 - [c23]Alexandra Jimborean, Philippe Clauss, Benoît Pradelle, Luis Mastrangelo, Vincent Loechner:
Adapting the polyhedral model as a framework for efficient speculative parallelization. PPoPP 2012: 295-296 - 2011
- [c22]Alain Ketterlin, Philippe Clauss:
Efficient memory tracing by program skeletonization. ISPASS 2011: 97-106 - [c21]Alexandra Jimborean, Matthieu Herrmann, Vincent Loechner, Philippe Clauss:
VMAD: A virtual machine for advanced dynamic analysis of programs. ISPASS 2011: 125-126 - [c20]Benoît Pradelle, Philippe Clauss, Vincent Loechner:
Adaptive runtime selection of parallel schedules in the polytope model. SpringSim (HPC) 2011: 81-88 - 2010
- [c19]Alain Ketterlin, Philippe Clauss:
Recovering the Memory Behavior of Executable Programs. SCAM 2010: 189-198
2000 – 2009
- 2009
- [j9]Jean Christophe Beyler, Michael Klemm, Philippe Clauss, Michael Philippsen:
A meta-predictor framework for prefetching in object-based DSMs. Concurr. Comput. Pract. Exp. 21(14): 1789-1803 (2009) - [j8]Philippe Clauss, Federico Javier Fernández, Diego Garbervetsky, Sven Verdoolaege:
Symbolic Polynomial Maximization Over Convex Sets and Its Application to Memory Requirement Estimation. IEEE Trans. Very Large Scale Integr. Syst. 17(8): 983-996 (2009) - [c18]Ogier Maitre, Nicolas Lachiche, Philippe Clauss, Laurent A. Baumes, Avelino Corma, Pierre Collet:
Efficient Parallel Implementation of Evolutionary Algorithms on GPGPU Cards. Euro-Par 2009: 974-985 - 2008
- [c17]Alain Ketterlin, Philippe Clauss:
Prediction and trace compression of data access addresses through nested loop recognition. CGO 2008: 94-103 - [c16]Jean Christophe Beyler, Michael Klemm, Michael Philippsen, Philippe Clauss:
Automatic Prefetching with Binary Code Rewriting in Object-Based DSMs. Euro-Par 2008: 643-653 - 2007
- [c15]Michael Klemm, Jean Christophe Beyler, Ronny T. Lampert, Michael Philippsen, Philippe Clauss:
Esodyp+: Prefetching in the Jackal Software DSM. Euro-Par 2007: 563-573 - [c14]Jean Christophe Beyler, Philippe Clauss:
Performance driven data cache prefetching in a dynamic software optimization system. ICS 2007: 202-209 - 2006
- [c13]Philippe Clauss, Bénédicte Kenmei:
Polyhedral Modeling and Analysis of Memory Access Profiles. ASAP 2006: 191-198 - 2005
- [c12]Philippe Clauss, Bénédicte Kenmei, Jean Christophe Beyler:
The Periodic-Linear Model of Program Behavior Capture. Euro-Par 2005: 325-335 - 2004
- [c11]Philippe Clauss, Irina Tchoupaeva:
A Symbolic Approach to Bernstein Expansion for Program Analysis and Optimization. CC 2004: 120-133 - 2002
- [j7]Vincent Loechner, Benoît Meister, Philippe Clauss:
Precise Data Locality Optimization of Nested Loops. J. Supercomput. 21(1): 37-76 (2002) - 2001
- [c10]Vincent Loechner, Benoît Meister, Philippe Clauss:
Data Sequence Locality: A Generalization of Temporal Locality. Euro-Par 2001: 262-272 - 2000
- [j6]Philippe Clauss, Benoît Meister:
Automatic memory layout transformations to optimize spatial locality in parameterized loop nests. SIGARCH Comput. Archit. News 28(1): 11-19 (2000)
1990 – 1999
- 1998
- [j5]Philippe Clauss, Vincent Loechner:
Parametric Analysis of Polyhedral Iteration Spaces. J. VLSI Signal Process. 19(2): 179-194 (1998) - 1997
- [c9]Philippe Clauss:
Handling Memory Cache Policy with Integer Points Counting. Euro-Par 1997: 285-293 - 1996
- [c8]Philippe Clauss, Vincent Loechner:
Parametric Analysis of Polyhedral Iteration Spaces. ASAP 1996: 415- - [c7]Philippe Clauss:
Counting Solutions to Linear and Nonlinear Constraints Through Ehrhart Polynomials: Applications to Analyze and Transform Scientific Programs. International Conference on Supercomputing 1996: 278-285 - 1994
- [j4]Catherine Mongenet, Philippe Clauss, Guy-René Perrin:
Geometrical Tools to Map Systems of Affine Recurrence Equations on Regular Arrays. Acta Informatica 31(2): 137-160 (1994) - [c6]Philippe Clauss, Guy-René Perrin:
Optimal mapping of systolic algorithms by regular instruction shifts. ASAP 1994: 224-235 - [c5]Philippe Clauss:
An Efficient Allocation Strategy for Mapping Affine Recurrences into Space and Time Optimal Regular Processor Arrays. Parcella 1994: 257-266 - 1993
- [j3]Philippe Clauss, Catherine Mongenet:
Synthesis Aspects in the Design of Efficient Processor Arrays from Affine Recurrence Equations. J. Symb. Comput. 15(5/6): 547-569 (1993) - 1992
- [j2]Philippe Clauss, Catherine Mongenet, Guy-René Perrin:
Synthesis of size-optimal toroidal arrays for the Algebraic Path Problem: A new contribution. Parallel Comput. 18(2): 185-194 (1992) - [j1]Philippe Clauss, Catherine Mongenet, Guy-René Perrin:
Calculus of space-optimal mappings of systolic algorithms on processor arrays. J. VLSI Signal Process. 4(1): 27-36 (1992) - 1991
- [c4]Philippe Clauss, Catherine Mongenet, Guy-René Perrin:
Synthesis of size-optimal toroidal arrays for the algebraic path problem. Algorithms and Parallel VLSI Architectures 1991: 199-204 - [c3]Philippe Clauss:
Mapping Systolic Algorithms on Distributed Memory Computers. EDMCC 1991: 402-411 - [c2]Catherine Mongenet, Philippe Clauss, Guy-René Perrin:
A Geometrical Coding to Compile Affine Recurrence Equations on Regular Arrays. IPPS 1991: 582-590 - 1990
- [c1]Philippe Clauss, Catherine Mongenet, Guy-René Perrin:
Calculus of space-optimal mappings of systolic algorithms on processor arrays. ASAP 1990: 4-18
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
