Alain Darte

78 papers A 8B 8C 2Misc 3Journal 30Unranked 24
YearRankTypeTitle / Venue / Authors
2016 B conf
Extended lattice-based memory allocation.
CC
Alain Darte, Alexandre Isoard, Tomofumi Yuki
2015 B conf
Exact and Approximated Data-Reuse Optimizations for Tiling with Parametric Sizes.
CC
Alain Darte, Alexandre Isoard
2014 J jnl
Studying Optimal Spilling in the Light of SSA.
ACM Trans. Archit. Code Optim.
Quentin Colombet, Florian Brandner, Alain Darte
2013 A conf
Optimizing remote accesses for offloaded kernels: application to high-level synthesis for FPGA.
DATE
Christophe Alias, Alain Darte, Alexandru Plesco
2013 — conf
Rank: A Tool to Check Program Termination and Computational Complexity.
ICST Workshops
Christophe Alias, Alain Darte, Paul Feautrier, Laure Gonnord
2012 B conf
Optimizing remote accesses for offloaded kernels: application to high-level synthesis for FPGA.
PPoPP
Christophe Alias, Alain Darte, Alexandru Plesco
2012 J jnl
SSI Properties Revisited.
ACM Trans. Embed. Comput. Syst.
Benoit Boissinot, Philip Brisk, Alain Darte, Fabrice Rastello
2011 B conf
A Non-iterative Data-Flow Algorithm for Computing Liveness Sets in Strict SSA Programs.
APLAS
Benoit Boissinot, Florian Brandner, Alain Darte, Benoît Dupont de Dinechin, Fabrice Rastello
2011 — ch.
Parallelism Detection in Nested Loops, Optimal.
Encyclopedia of Parallel Computing
Alain Darte
2011 Misc conf
Studying optimal spilling in the light of SSA.
CASES
Quentin Colombet, Florian Brandner, Alain Darte
2010 B conf
Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs.
SAS
Christophe Alias, Alain Darte, Paul Feautrier, Laure Gonnord
2010 — conf
Optimizing DDR-SDRAM communications at C-level for automatically-generated hardware accelerators an experience with the Altera C2H HLS tool.
ASAP
Christophe Alias, Alain Darte, Alexandru Plesco
2010 C conf
Parallel copy motion.
SCOPES
Florent Bouchez, Quentin Colombet, Alain Darte, Fabrice Rastello, Christophe Guillon
2010 C conf
Understanding loops: The influence of the decomposition of Karp, Miller, and Winograd.
MEMOCODE
Alain Darte
2009 — conf
Introduction.
Euro-Par
Pedro C. Diniz, Ben H. H. Juurlink, Alain Darte, Wolfgang Karl
2009 A conf
Revisiting Out-of-SSA Translation for Correctness, Code Quality and Efficiency.
CGO
Benoit Boissinot, Alain Darte, Fabrice Rastello, Benoît Dupont de Dinechin, Christophe Guillon
2008 Misc conf
Advanced conservative and optimistic register coalescing.
CASES
Florent Bouchez, Alain Darte, Fabrice Rastello
2007 B conf
Bee+Cl@k: an implementation of lattice-based array contraction in the source-to-source translator rose.
LCTES
Christophe Alias, Fabrice Baray, Alain Darte
2007 A conf
On the Complexity of Register Coalescing.
CGO
Florent Bouchez, Alain Darte, Fabrice Rastello
2007 J jnl
On the Complexity of Spill Everywhere under SSA Form
CoRR
Florent Bouchez, Alain Darte, Fabrice Rastello
2007 B conf
On the complexity of spill everywhere under SSA form.
LCTES
Florent Bouchez, Alain Darte, Fabrice Rastello
2007 J jnl
Reservation table scheduling: branch-and-bound based optimization
RAIRO Oper. Res.
Hadda Cherroun, Alain Darte, Paul Feautrier
2007 — conf
Scheduling Register-Allocated Codes in User-Guided High-Level Synthesis.
ASAP
Alain Darte, C. Quinson
2006 — conf
Register Allocation: What Does the NP-Completeness Proof of Chaitin et al. Really Prove? Or Revisiting Register Allocation: Why and How.
LCPC
Florent Bouchez, Alain Darte, Christophe Guillon, Fabrice Rastello
2006 A conf
Scheduling under resource constraints using dis-equations.
DATE
Hadda Cherroun, Alain Darte, Paul Feautrier
2005 B conf
A linear-time algorithm for optimal barrier placement.
PPoPP
Alain Darte, Robert Schreiber
2005 — conf
Hardware/Software Interface for Multi-Dimensional Processor Arrays.
ASAP
Alain Darte, Steven Derrien, Tanguy Risset
2005 J jnl
Lattice-Based Memory Allocation.
IEEE Trans. Computers
Alain Darte, Robert Schreiber, Gilles Villard
2005 J jnl
New Complexity Results on Array Contraction and Related Problems.
J. VLSI Signal Process.
Alain Darte, Guillaume Huard
2003 J jnl
Generalized multipartitioning of multi-dimensional arrays for parallelizing line-sweep computations.
J. Parallel Distributed Comput.
Alain Darte, John M. Mellor-Crummey, Robert J. Fowler, Daniel G. Chavarría-Miranda
2003 Misc conf
Lattice-based memory allocation.
CASES
Alain Darte, Robert Schreiber, Gilles Villard
2002 A conf
Complexity of Multi-dimensional Loop Alignment.
STACS
Alain Darte, Guillaume Huard
2002 J jnl
Constructing and exploiting linear schedules with prescribed parallelism.
ACM Trans. Design Autom. Electr. Syst.
Alain Darte, Robert Schreiber, B. Ramakrishna Rau, Frédéric Vivien
2002 A conf
Generalized Multipartitioning for Multi-Dimensional Arrays.
IPDPS
Daniel G. Chavarría-Miranda, Alain Darte, Robert J. Fowler, John M. Mellor-Crummey
2002 — conf
New Results on Array Contraction.
ASAP
Alain Darte, Guillaume Huard
2001 — conf
Loop Parallelization Algorithms.
Compiler Optimizations for Scalable Parallel Systems Languages
Alain Darte, Yves Robert, Frédéric Vivien
2000 A conf
A Constructive Solution to the Juggling Problem in Processor Array Synthesis.
IPDPS
Alain Darte, Robert Schreiber, B. Ramakrishna Rau, Frédéric Vivien
2000 J jnl
Loop Shifting for Loop Compaction.
Int. J. Parallel Program.
Alain Darte, Guillaume Huard
2000 J jnl
On the complexity of loop fusion.
Parallel Comput.
Alain Darte
2000 — book
Scheduling and automatic parallelization.
Alain Darte, Yves Robert, Frédéric Vivien
2000 — conf
Scheduling the Computations of a Loop Nest with Respect to a Given Mapping.
Euro-Par
Alain Darte, Claude G. Diderich, Marc Gengler, Frédéric Vivien
2000 — conf
Temporary Arrays for Distribution of Loops with Control Dependences.
Euro-Par
Alain Darte, Georges-André Silber
1999 — conf
Loop Shifting for Loop Compaction.
LCPC
Alain Darte, Guillaume Huard
1999 — conf
On the Complexity of Loop Fusion.
IEEE PACT
Alain Darte
1999 — conf
the NESTOR Library: A Tool for Implementing FORTRAN Source Transformations.
HPCN Europe
Georges-André Silber, Alain Darte
1998 J jnl
Circuit Retiming Applied to Decomposed Software Pipelining.
IEEE Trans. Parallel Distributed Syst.
Pierre-Yves Calland, Alain Darte, Yves Robert
1998 J jnl
Loop Parallelization Algorithms: From Parallelism Extraction to Code Generation.
Parallel Comput.
Pierre Boulet, Alain Darte, Georges-André Silber, Frédéric Vivien
1998 J jnl
On the Removal of Anti- and Output-Dependences.
Int. J. Parallel Program.
Pierre-Yves Calland, Alain Darte, Yves Robert, Frédéric Vivien
1997 J jnl
Combining Retiming and Scheduling Techniques for Loop Parallelization and Loop Tiling.
Parallel Process. Lett.
Alain Darte, Georges-André Silber, Frédéric Vivien
1997 J jnl
HPFIT: A Set of Integrated Tools for the Parallelization of Applications Using High Performance Fortran. PART I: HPFIT and the TransTOOL Environment.
Parallel Comput.
Thomas Brandes, Serge Chaumette, Marie Christine Counilh, Jean Roman, Alain Darte, Frederic Desprez, J. C. Mignot
1997 J jnl
On the Optimality of Allen and Kennedy's Algorithm for Parallelism Extraction in Nested Loops.
Parallel Algorithms Appl.
Alain Darte, Frédéric Vivien
1997 J jnl
Optimal Fine and Medium Grain Parallelism Detection in Polyhedral Reduced Dependence Graphs.
Int. J. Parallel Program.
Alain Darte, Frédéric Vivien
1997 J jnl
Parallelizing Nested Loops with Approximations of Distance Vectors: A Survey.
Parallel Process. Lett.
Alain Darte, Frédéric Vivien
1997 J jnl
Plugging Anti and Output Dependence Removal Techniques Into Loop Parallelization Algorithm.
Parallel Comput.
Pierre-Yves Calland, Alain Darte, Yves Robert, Frédéric Vivien
1996 J jnl
A Characterization of One-to-One Modular Mappings.
Parallel Process. Lett.
Alain Darte, Michèle Dion, Yves Robert
1996 A conf
A New Guaranteed Heuristic for the Software Pipelining Problem.
International Conference on Supercomputing
Pierre-Yves Calland, Alain Darte, Yves Robert
1996 — conf
On the Optimality of Allen and Kennedy's Algorithm for Parallel Extraction in Nested Loops.
Euro-Par, Vol. I
Alain Darte, Frédéric Vivien
1996 — conf
On the Removal of Anti and Output Dependences.
ASAP
Pierre-Yves Calland, Alain Darte, Yves Robert, Frédéric Vivien
1996 — conf
Optimal fine and medium grain parallelism detection in polyhedral reduced dependence graphs.
IEEE PACT
Alain Darte, Frédéric Vivien
1996 — ed.
The Data Parallel Programming Model: Foundations, HPF Realization, and Scientific Applications
The Data Parallel Programming Model
Guy-René Perrin, Alain Darte
1995 — conf
A characterization of one-to-one modular mappings.
SPDP
Alain Darte, Michèle Dion, Yves Robert
1995 J jnl
Affine-by-Statement Scheduling of Uniform and Affine Loop Nests over Parametric.
J. Parallel Distributed Comput.
Alain Darte, Yves Robert
1995 J jnl
Evaluating Array Expressions On Massively Parallel Machines With Communication/ Computation Overlap.
Int. J. High Perform. Comput. Appl.
Vincent Bouchitté, Pierre Boulet, Alain Darte, Yves Robert
1995 — conf
Revisiting the Decomposition of Karp, Miller and Winograd.
ASAP
Alain Darte, Frédéric Vivien
1995 J jnl
Revisiting the Decomposition of Karp, Miller and Winograd.
Parallel Process. Lett.
Alain Darte, Frédéric Vivien
1994 J jnl
(Pen)-ultimate tiling?
Integr.
Pierre Boulet, Alain Darte, Tanguy Risset, Yves Robert
1994 J jnl
Constructive Methods for Scheduling Uniform Loop Nests.
IEEE Trans. Parallel Distributed Syst.
Alain Darte, Yves Robert
1994 — conf
Evaluating Array Expressions on Massively Parallel Machines with Communication/ Computation Overlap.
CONPAR
Vincent Bouchitté, Pierre Boulet, Alain Darte, Yves Robert
1994 J jnl
Mapping Uniform Loop Nests Onto Distributed Memory Architectures.
Parallel Comput.
Alain Darte, Yves Robert
1994 J jnl
On the Alignment Problem.
Parallel Process. Lett.
Alain Darte, Yves Robert
1993 — conf
Communication-minimal mapping of uniform loop nests onto distributed memory architectures.
ASAP
Alain Darte, Yves Robert
1993 — conf
Mapping Uniform Loop Nests onto Distributed Memory Architectures.
PARCO
Alain Darte
1992 J jnl
Erratum to: Regular partitioning for synthesizing fixed-size systolic arrays.
Integr.
Alain Darte
1992 — conf
Linear scheduling is close to optimality.
ASAP
Alain Darte, Leonid Khachiyan, Yves Robert
1991 J jnl
Linear Scheduling Is Nearly Optimal.
Parallel Process. Lett.
Alain Darte, Leonid Khachiyan, Yves Robert
1991 J jnl
Regular partitioning for synthesizing fixed-size systolic arrays.
Integr.
Alain Darte
1991 — conf
Synthesizing systolic arrays: some recent developments.
ASAP
Alain Darte, Tanguy Risset, Yves Robert
1991 — conf
Two heuristics for task scheduling.
Algorithms and Parallel VLSI Architectures
Alain Darte