dblp.uni-trier.dewww.uni-trier.de

Philippe Clauss

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2008
21EEAlain Ketterlin, Philippe Clauss: Prediction and trace compression of data access addresses through nested loop recognition. CGO 2008: 94-103
20EEJean Christophe Beyler, Michael Klemm, Michael Philippsen, Philippe Clauss: Automatic Prefetching with Binary Code Rewriting in Object-Based DSMs. Euro-Par 2008: 643-653
2007
19EEMichael Klemm, Jean Christophe Beyler, Ronny T. Lampert, Michael Philippsen, Philippe Clauss: Esodyp+: Prefetching in the Jackal Software DSM. Euro-Par 2007: 563-573
18EEJean Christophe Beyler, Philippe Clauss: Performance driven data cache prefetching in a dynamic software optimization system. ICS 2007: 202-209
2006
17EEPhilippe Clauss, Bénédicte Kenmei: Polyhedral Modeling and Analysis of Memory Access Profiles. ASAP 2006: 191-198
2005
16EEPhilippe Clauss, Bénédicte Kenmei, Jean Christophe Beyler: The Periodic-Linear Model of Program Behavior Capture. Euro-Par 2005: 325-335
2004
15EEPhilippe Clauss, Irina Tchoupaeva: A Symbolic Approach to Bernstein Expansion for Program Analysis and Optimization. CC 2004: 120-133
2002
14 Vincent Loechner, Benoît Meister, Philippe Clauss: Precise Data Locality Optimization of Nested Loops. The Journal of Supercomputing 21(1): 37-76 (2002)
2001
13EEVincent Loechner, Benoît Meister, Philippe Clauss: Data Sequence Locality: A Generalization of Temporal Locality. Euro-Par 2001: 262-272
1998
12EEPhilippe Clauss, Vincent Loechner: Parametric Analysis of Polyhedral Iteration Spaces. VLSI Signal Processing 19(2): 179-194 (1998)
1997
11 Philippe Clauss: Handling Memory Cache Policy with Integer Points Counting. Euro-Par 1997: 285-293
1996
10EEPhilippe Clauss, Vincent Loechner: Parametric Analysis of Polyhedral Iteration Spaces. ASAP 1996: 415-
9EEPhilippe 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
8 Philippe Clauss: An Efficient Allocation Strategy for Mapping Affine Recurrences into Space and Time Optimal Regular Processor Arrays. Parcella 1994: 257-266
7 Catherine Mongenet, Philippe Clauss, Guy-René Perrin: Geometrical Tools to Map Systems of Affine Recurrence Equations on Regular Arrays. Acta Inf. 31(2): 137-160 (1994)
1993
6 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
5 Philippe Clauss, Catherine Mongenet, Guy-René Perrin: Synthesis of size-optimal toroidal arrays for the Algebraic Path Problem: A new contribution. Parallel Computing 18(2): 185-194 (1992)
4EEPhilippe Clauss, Catherine Mongenet, Guy-René Perrin: Calculus of space-optimal mappings of systolic algorithms on processor arrays. VLSI Signal Processing 4(1): 27-36 (1992)
1991
3 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
2 Philippe Clauss: Mapping Systolic Algorithms on Distributed Memory Computers. EDMCC 1991: 402-411
1 Catherine Mongenet, Philippe Clauss, Guy-René Perrin: A Geometrical Coding to Compile Affine Recurrence Equations on Regular Arrays. IPPS 1991: 582-590

Coauthor Index

1Jean Christophe Beyler [16] [18] [19] [20]
2Bénédicte Kenmei [16] [17]
3Alain Ketterlin [21]
4Michael Klemm [19] [20]
5Ronny T. Lampert [19]
6Vincent Loechner [10] [12] [13] [14]
7Benoît Meister [13] [14]
8Catherine Mongenet [1] [3] [4] [5] [6] [7]
9Guy-René Perrin [1] [3] [4] [5] [7]
10Michael Philippsen [19] [20]
11Irina Tchoupaeva [15]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)