Name
Affiliation
Papers
ALAIN DARTE
CNRS
54
Collaborators
Citations 
PageRank 
45
888
56.40
Referers 
Referees 
References 
1170
644
665
Search Limit
1001000
Title
Citations
PageRank
Year
Extended lattice-based memory allocation.00.342016
Rank: A Tool to Check Program Termination and Computational Complexity30.402013
Optimizing remote accesses for offloaded kernels: Application to high-level synthesis for FPGA90.682013
SSI Properties Revisited20.352012
A non-iterative data-flow algorithm for computing liveness sets in strict SSA programs20.372011
Studying Optimal Spilling in the Light of SSA50.412011
Multi-dimensional rankings, program termination, and complexity bounds of flowchart programs621.642010
Optimizing DDR-SDRAM communications at C-level for automatically-generated hardware accelerators an experience with the Altera C2H HLS tool50.462010
Understanding loops: The influence of the decomposition of Karp, Miller, and Winograd20.382010
Parallel copy motion40.442010
Revisiting Out-of-SSA Translation for Correctness, Code Quality and Efficiency210.782009
Advanced conservative and optimistic register coalescing80.492008
On the Complexity of Register Coalescing260.922007
Reservation table scheduling: branch-and-bound based optimization vs. integer linear programming techniques.20.412007
On the complexity of spill everywhere under SSA form150.652007
Scheduling under resource constraints using dis-equations00.342006
Register allocation: what does the NP-completeness proof of Chaitin et al. really prove? or revisiting register allocation: why and how200.712006
New Complexity Results on Array Contraction and Related Problems60.442005
Hardware/Software Interface for Multi-Dimensional Processor Arrays40.422005
Lattice-Based Memory Allocation512.052005
A linear-time algorithm for optimal barrier placement40.472005
Generalized multipartitioning of multi-dimensional arrays for parallelizing line-sweep computations150.822003
Constructing and exploiting linear schedules with prescribed parallelism151.022002
Generalized Multipartitioning for Multi-Dimensional Arrays40.492002
New Results on Array Contraction60.482002
Complexity of Multi-dimensional Loop Alignment80.522002
Scheduling and Automatic Parallelization783.592001
Loop Parallelization Algorithms20.372001
A Constructive Solution to the Juggling Problem in Processor Array Synthesis100.622000
Temporary Arrays for Distribution of Loops with Control Dependences00.342000
On the complexity of loop fusion562.202000
Scheduling the Computations of a Loop Nest with Respect to a Given Mapping20.382000
Loop Shifting for Loop Compaction150.711999
the NESTOR Library: A Tool for Implementing FORTRAN Source Transformations60.491999
Circuit Retiming Applied to Decomposed Software Pipelining260.971998
Loop parallelization algorithms: from parallelism extraction to code generation372.761998
On the Removal of Anti- and Output-Dependences40.401998
Parallelizing Nested Loops with Approximations of Distance Vectors: A Survey10.361997
Optimal fine and medium grain parallelism detection in polyhedral reduced dependence graphs372.651997
Combining Retiming and Scheduling Techniques for Loop Parallelization and Loop Tiling341.821997
Plugging Anti And Output Dependence Removal Techniques Into Loop Parallelization Algorithms50.611997
The Data Parallel Programming Model: Foundations, HPF Realization, and Scientific Applications131.651996
A new guaranteed heuristic for the software pipelining problem50.701996
On the Optimality of Allen and Kennedy's Algorithm for Parallel Extraction in Nested Loops121.101996
Affine-by-Statement Scheduling of Uniform and Affine Loop Nests over Parametric Domains190.991995
Revisiting the Decomposition of Karp, Miller and Winograd50.591995
On the Alignment Problem130.881994
Evaluating Array Expressions On Massively Parallel Machines With Communication/ Computation Overlap.70.601994
(Pen)-ultimate tiling?714.421994
Mapping uniform loop nests onto distributed memory architectures372.791994
  • 1
  • 2