Filtrer vos résultats
- 64
- 23
- 37
- 25
- 22
- 2
- 1
- 22
- 84
- 1
- 1
- 5
- 3
- 2
- 2
- 3
- 3
- 5
- 2
- 2
- 3
- 1
- 1
- 4
- 1
- 3
- 8
- 12
- 8
- 9
- 3
- 3
- 3
- 87
- 86
- 45
- 7
- 7
- 4
- 4
- 3
- 3
- 3
- 2
- 2
- 1
- 87
- 34
- 26
- 13
- 8
- 8
- 7
- 7
- 6
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
87 résultats
A Constructive Solution to the Juggling Problem in Processor Array SynthesisProceedings of the International Parallel and Distributed Processing Symposium (IPDPS 2000), 2000, Cancun, Mexico
Communication dans un congrès
hal-00856646v1
|
|||
|
|
Plugging anti and output dependence removal techniques into loop parallelization algorithmsParallel Computing, 1997, 23 (1-2), pp.251-266. ⟨10.1016/S0167-8191(96)00108-1⟩
Article dans une revue
hal-00856884v1
|
||
Formal methods for solving the algebraic path problemApplication-driven architecture synthesis, 1993, Unknown, pp.47-69
Communication dans un congrès
hal-00857078v1
|
|||
Evaluating array expressions on massively parallel machines with communication/computation overlapParallel Processing: CONPAR94 - VAPP VI, 1994, Unknown, pp.713-724
Communication dans un congrès
hal-00857085v1
|
|||
|
|
Bee+Cl@k: An Implementation of Lattice-Based Array Contraction in the Source-to-Source Translator ROSEACM SIGPLAN/SIGBED Conference on Languages, Compilers, and Tools for Embedded Systems (LCTES'07), Jun 2007, San Diego, United States. ⟨10.1145/1273444.1254778⟩
Communication dans un congrès
hal-03106126v1
|
||
Rank: a tool to check program termination and computational complexityConstraints in Software Testing Verification and Analysis, Mar 2013, Luxembourg
Communication dans un congrès
hal-00801571v1
|
|||
Special issue on Compilers for parallel computersA. Darte and Y. Robert and G.A. Silber. Parallel Processing Letters, 10, pp.151-250, 2000
Ouvrages
hal-00856644v1
|
|||
Loop parallelization algorithms: from parallelism extraction to code generation[Research Report] 97--17, 1997
Rapport
hal-00856896v1
|
|||
Exact and Approximated Data-Reuse Optimizations for Tiling with Parametric Sizes24th International Conference on Compiler Construction (CC'15), part of ETAPS'15, Apr 2015, London, United Kingdom
Communication dans un congrès
hal-01099017v1
|
|||
Evaluating array expressions on massively parallel machines with communication/computation overlapInternational Journal of Supercomputer Applications and High Performance Computing, 1995, 9 (3), pp.205-219
Article dans une revue
inria-00564991v1
|
|||
|
|
Improvements to Conservative and Optimistic Register CoalescingProceedings of the 2008 international conference on Compilers, architectures and synthesis for embedded systems, 2008, pp.147-156. ⟨10.1145/1450095.1450119⟩
Article dans une revue
ensl-00179685v1
|
||
|
|
SSI Properties RevisitedACM Transactions on Embedded Computing Systems (TECS), 2012, 11S (1), ⟨10.1145/2180887.2180898⟩
Article dans une revue
hal-00761505v1
|
||
|
|
Program Termination and Worst Time Complexity with Multi-Dimensional Affine Ranking Functions[Research Report] 2009, pp.31
Rapport
inria-00434037v1
|
||
A characterization of one-to-one modular mappingsParallel Processing Letters, 1996, 5, pp.145-157
Article dans une revue
hal-00856914v1
|
|||
On the optimality of Allen and Kennedy's algorithm for parallelism extraction in nested loops[Research Report] 96-05, 1996
Rapport
hal-00856922v1
|
|||
Synthesizing systolic algorithms: some recent developmentsApplication Specific Array Processors 91, 1991, Unknown, pp.373-386
Communication dans un congrès
hal-00857053v1
|
|||
Mapping uniform loop nests onto distributed memory architecturesParallel Computing, 1994, 20, pp.679-710
Article dans une revue
hal-00857082v1
|
|||
Extended Lattice-Based Memory Allocation25th International Conference on Compiler Construction (CC'16), Mar 2016, Barcelona, Spain
Communication dans un congrès
hal-01272969v1
|
|||
|
|
Optimizing DDR-SDRAM Communications at C-level for Automatically-Generated Hardware AcceleratorsIEEE International Conference on Application-specific Systems, Architectures and Processors (ASAP'10), Jul 2010, Rennes, France
Communication dans un congrès
hal-01664033v1
|
||
|
|
On the Complexity of Spill Everywhere under SSA FormACM SIGPLAN Notices, 2007, Volume 42 (Issue 7), pp.103 - 112. ⟨10.1145/1254766.1254782⟩
Article dans une revue
ensl-00180322v1
|
||
|
|
HPFIT: A Set of Integrated Tools for the Parallelization of Applications Using High Performance Fortran[Research Report] RR-3059, INRIA. 1996
Rapport
inria-00073633v1
|
||
Scheduling uniform loop nestsISMM Conference on Parallel and Distributed Systems, 1992, Unknown, pp.75-82
Communication dans un congrès
hal-00857069v1
|
|||
Séquencement des nids de bouclesAlgorithmique Parallèle, 1992, Unknown, pp.343-368
Communication dans un congrès
hal-00857071v1
|
|||
The alignment problem for perfect uniform loop nests: NP-completeness and heuristicsEnvironments and Tools for Parallel Scientific Computing II, 1994, Unknown, pp.33-42
Communication dans un congrès
hal-00857086v1
|
|||
Revisiting the Decomposition of Karp, Miller and WinogradParallel Processing Letters, 1995, 5 (4), pp.551-562
Article dans une revue
hal-00857092v1
|
|||
Revisiting the Decomposition of Karp, Miller and WinogradApplication Specific Array Processors, 1995, Strasbourg, France. pp.13--25
Communication dans un congrès
hal-00857094v1
|
|||
Scheduling the Computations of a Loop Nest with Respect to a Given MappingProceedings of Euro-Par 2000, 2000, Munich, Germany. pp.405--414
Communication dans un congrès
hal-00856647v1
|
|||
A Constructive Solution to the Juggling Problem in Systolic Array Synthesis[Research Report] RR1999-15, 1999
Rapport
hal-00856659v1
|
|||
On the Optimality of Allen and Kennedy's Algorithm for Parallelism Extraction in Nested LoopsProceedings of Euro-Par'96, 1996, Lyon, France. pp.379--388
Communication dans un congrès
hal-00856919v1
|
|||
Optimal fine and medium grain parallelism detection in polyhedral reduced dependence graphs[Research Report] 96-06, 1996
Rapport
hal-00856920v1
|