default search action
Paul Feautrier
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
- [c45]Paul Feautrier, Eric Violard, Alain Ketterlin:
Improving the Performance of X10 Programs by Clock Removal. CC 2014: 113-132 - [c44]Paul Feautrier:
Author retrospective for array expansion, array shrinking, or there and back again. ICS 25th Anniversary 2014: 6 - 2013
- [c43]Christophe Alias, Alain Darte, Paul Feautrier, Laure Gonnord:
Rank: A Tool to Check Program Termination and Computational Complexity. ICST Workshops 2013: 238 - [c42]Tomofumi Yuki, Paul Feautrier, Sanjay V. Rajopadhye
, Vijay A. Saraswat:
Array dataflow analysis for polyhedral X10 programs. PPoPP 2013: 23-34 - [i2]Tomofumi Yuki, Paul Feautrier, Sanjay V. Rajopadhye, Vijay A. Saraswat:
Checking Race Freedom of Clocked X10 Programs. CoRR abs/1311.4305 (2013) - 2011
- [r4]Paul Feautrier:
Bernstein's Conditions. Encyclopedia of Parallel Computing 2011: 130-134 - [r3]Paul Feautrier:
Dependences. Encyclopedia of Parallel Computing 2011: 557-561 - [r2]Paul Feautrier:
Layout, Array. Encyclopedia of Parallel Computing 2011: 1006-1010 - [r1]Paul Feautrier, Christian Lengauer:
Polyhedron Model. Encyclopedia of Parallel Computing 2011: 1581-1592 - 2010
- [c41]Christophe Alias, Alain Darte, Paul Feautrier, Laure Gonnord:
Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs. SAS 2010: 117-133 - [c40]Paul Feautrier, Laure Gonnord:
Accelerated Invariant Generation for C Programs with Aspic and C2fsm. TAPAS@SAS 2010: 3-13
2000 – 2009
- 2009
- [j18]Nicolas Fournel, Antoine Fraboulet, Paul Feautrier:
Embedded software energy characterization: Using non-intrusive measures for application source code annotation. J. Embed. Comput. 3(3): 179-188 (2009) - [j17]Philippe Grosse, Yves Durand, Paul Feautrier:
Methods for power optimization in SOC-based data flow systems. ACM Trans. Design Autom. Electr. Syst. 14(3): 38:1-38:20 (2009) - [c39]Ouassila Labbani
Elementary transformation analysis for Array-OL. AICCSA 2009: 362-367 - 2007
- [j16]Hadda Cherroun, Alain Darte, Paul Feautrier:
Reservation table scheduling: branch-and-bound based optimization vs. integer linear programming techniques. RAIRO Oper. Res. 41(4): 427-454 (2007) - [c38]Hadda Cherroun, Paul Feautrier:
An Exact Resource Constrained-Scheduler using Graph Coloring technique. AICCSA 2007: 554-561 - [c37]Nicolas Fournel, Antoine Fraboulet, Paul Feautrier:
Fast and Accurate Embedded Systems Energy Characterization Using Non-intrusive Measurements. PATMOS 2007: 10-19 - [c36]Nicolas Fournel, Antoine Fraboulet, Paul Feautrier:
eSimu: a Fast and Accurate Energy Consumption Simulator for Real Embedded System. WOWMOM 2007: 1-6 - [i1]Paul Feautrier:
Elementary transformation analysis for Array-OL. CoRR abs/0705.2145 (2007) - 2006
- [j15]Paul Feautrier:
Scalable and Structured Scheduling. Int. J. Parallel Program. 34(5): 459-487 (2006) - [c35]Hadda Cherroun, Alain Darte, Paul Feautrier:
Scheduling under resource constraints using dis-equations. DATE 2006: 1067-1072 - [c34]Philippe Grosse, Yves Durand, Paul Feautrier:
Power Modeling of a NoC Based Design for High Speed Telecommunication Systems. PATMOS 2006: 157-168 - [c33]Pierre Amiranoff, Albert Cohen, Paul Feautrier:
Beyond Iteration Vectors: Instancewise Relational Abstract Domains. SAS 2006: 161-180 - 2005
- [j14]Cédric Bastoul, Paul Feautrier:
Adjusting a Program Transformation for Legality. Parallel Process. Lett. 15(1-2): 3-18 (2005) - 2004
- [c32]Cédric Bastoul, Paul Feautrier:
More Legal Transformations for Locality. Euro-Par 2004: 272-283 - [c31]Paul Feautrier:
From Software to Hardware and Back. FORMATS/FTRTFT 2004: 1-2 - [c30]Paul Feautrier:
Scalable and Modular Scheduling. SAMOS 2004: 433-442 - [e1]Paul Feautrier, James R. Goodman, André Seznec:
Proceedings of the 18th Annual International Conference on Supercomputing, ICS 2004, Saint Malo, France, June 26 - July 01, 2004. ACM 2004, ISBN 1-58113-839-3 [contents] - 2003
- [c29]Cédric Bastoul, Paul Feautrier:
Improving Data Locality by Chunking. CC 2003: 320-334 - [c28]Basilio B. Fraguela, Jose Renau, Paul Feautrier, David A. Padua, Josep Torrellas:
Programming the FlexRAM parallel intelligent memory system. PPoPP 2003: 49-60 - 2002
- [c27]Albert Cohen, Daniela Genius, Abdesselem Kortebi, Zbigniew Chamski, Marc Duranton, Paul Feautrier:
Multi-periodic Process Networks: Prototyping and Verifying Stream-Processing Systems. Euro-Par 2002: 137-146 - [c26]Denis Barthou
On the Equivalence of Two Systems of Affine Recurrence Equations (Research Note). Euro-Par 2002: 309-313 - [c25]Peng Wu, Paul Feautrier, David A. Padua, Zehra Sura:
Instance-wise points-to analysis for loop-based dependence testing. ICS 2002: 262-273 - [c24]Martin Griebl, Paul Feautrier, Armin Größlinger:
Forward Communication Only Placements and Their Use for Parallel Program Construction. LCPC 2002: 16-30 - 2001
- [c23]Paul Feautrier:
Array Dataflow Analysis. Compiler Optimizations for Scalable Parallel Systems Languages 2001: 173-220 - 2000
- [j13]Martin Griebl, Paul Feautrier, Christian Lengauer:
Index Set Splitting. Int. J. Parallel Program. 28(6): 607-631 (2000) - [j12]Xavier Redon, Paul Feautrier:
Detection of Scans in the Polytope Model. Parallel Algorithms Appl. 15(3-4): 229-263 (2000) - [c22]Eric Renault, Pierre David, Paul Feautrier:
PCI-DDC Application Programming Interface: Performance in User-Level Messaging (Research Note). Euro-Par 2000: 1201-1205
1990 – 1999
- 1999
- [c21]Martin Griebl, Paul Feautrier, Christian Lengauer:
On Index Set Splitting. IEEE PACT 1999: 274-282 - 1998
- [j11]Vincent Lefebvre, Paul Feautrier:
Automatic Storage Management for Parallel Programs. Parallel Comput. 24(3-4): 649-671 (1998) - [c20]Pierre Boulet, Paul Feautrier:
Scanning Polyhedra without Do-loops. IEEE PACT 1998: 4-11 - [c19]Paul Feautrier:
A Parallelization Framework for Recursive Tree Programs. Euro-Par 1998: 470-479 - 1997
- [j10]Denis Barthou
Fuzzy Array Dataflow Analysis. J. Parallel Distributed Comput. 40(2): 210-226 (1997) - [c18]Paul Feautrier:
Basis of Parallel Speculative Execution. Euro-Par 1997: 3-14 - [c17]Vincent Lefebvre, Paul Feautrier:
Optimizing Storage Size for Static Control Programs in Automatic Parallelizers. Euro-Par 1997: 356-363 - [c16]Vincent Lefebvre, Paul Feautrier:
Storage management in parallel programs. PDP 1997: 181-188 - 1996
- [c15]Paul Feautrier:
Automatic Parallelization in the Polytope Model. The Data Parallel Programming Model 1996: 79-103 - [c14]Denis Barthou
Applicaions of Fuzzy Array Dataflow Analysis. Euro-Par, Vol. I 1996: 424-427 - [c13]Michel Barreteau, Paul Feautrier:
Efficient Mapping of Interdependent Scans. Euro-Par, Vol. I 1996: 463-466 - 1995
- [j9]Paul Feautrier:
Compiling for massively parallel architectures: a perspective. Microprocess. Microprogramming 41(5-6): 425-439 (1995) - [j8]Jean-Francois Collard, Tanguy Risset, Paul Feautrier:
Construction of Do Loops from Systems of Affine Constraints. Parallel Process. Lett. 5: 421-436 (1995) - [c12]Jean-Francois Collard, Denis Barthou
Fuzzy Array Dataflow Analysis. PPoPP 1995: 92-101 - 1994
- [j7]Paul Feautrier:
Toward Automatic Distribution. Parallel Process. Lett. 4: 233-244 (1994) - [c11]Mourad Raji Werth, Paul Feautrier:
Optimizing Communications by Using Compile Time Analysis. CONPAR 1994: 689-700 - [c10]Mourad Raji Werth, John Zahorjan, Paul Feautrier:
Using Compile-Time Conditional Analysis to Improve the Performance of Compiler Parallelized Programs. EUROSIM 1994: 521-530 - [c9]Xavier Redon, Paul Feautrier:
Scheduling reductions. International Conference on Supercomputing 1994: 117-125 - [c8]Paul Feautrier:
Fine-Grain Scheduling under Resource Constraints. LCPC 1994: 1-15 - 1993
- [c7]Paul Feautrier:
Toward Automatic Partitioning of Arrays on Distributed Memory Computers. International Conference on Supercomputing 1993: 175-184 - [c6]Xavier Redon, Paul Feautrier:
Detection of Recurrences in Sequential Programs with Loops. PARLE 1993: 132-145 - 1992
- [j6]Paul Feautrier:
Some efficient solutions to the affine scheduling problem. I. One-dimensional time. Int. J. Parallel Program. 21(5): 313-347 (1992) - [j5]Paul Feautrier:
Some efficient solutions to the affine scheduling problem. Part II. Multidimensional time. Int. J. Parallel Program. 21(6): 389-420 (1992) - [c5]Nadia Tawbi
Processor allocation and loop scheduling on multiprocessor computers. ICS 1992: 63-71 - 1991
- [j4]Paul Feautrier:
Dataflow analysis of array and scalar references. Int. J. Parallel Program. 20(1): 23-53 (1991) - 1990
- [j3]Pierre Jouvelot, Paul Feautrier:
Parallélisation sémantique. RAIRO Theor. Informatics Appl. 24: 131-159 (1990)
1980 – 1989
- 1988
- [c4]Paul Feautrier:
Array expansion. ICS 1988: 429-441 - 1986
- [c3]Rémi Triolet, Paul Feautrier, François Irigoin:
Automatic Parallelization of Fortran Programs in the Presence of Procedure Calls. ESOP 1986: 210-222 - [c2]Rémi Triolet, François Irigoin, Paul Feautrier:
Direct parallelization of call statements. SIGPLAN Symposium on Compiler Construction 1986: 176-185 - 1984
- [c1]Paul Feautrier:
Projet Vesta: outil de calcul symbolique. Symposium on Programming 1984: 113-124
1970 – 1979
- 1978
- [j2]Lucien M. Censier, Paul Feautrier:
A New Solution to Coherence Problems in Multicache Systems. IEEE Trans. Computers 27(12): 1112-1118 (1978) - 1975
- [j1]Paul Feautrier:
Post Grammars as a Programming Language Description Tool. RAIRO Theor. Informatics Appl. 9(1): 43-72 (1975)
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: