 | 1996 |
|---|
| 10 |       | Michèle Dion:
Affine Data Mapping with Residual Communication Optimization: Evaluation of Heuristics.
HPCN Europe 1996: 654-661 |
| 9 | | Michèle Dion,
Cyril Randriamaro,
Yves Robert:
How to Optimize Residual Communications?
IPPS 1996: 382-391 |
| 8 | | Michèle Dion,
Tanguy Risset,
Yves Robert:
Resource-constrained scheduling of partitioned algorithms on processor arrays.
Integration 20(2): 139-159 (1996) |
| 7 | | Michèle Dion,
Cyril Randriamaro,
Yves Robert:
Compiling Affine Nested Loops: How to Optimize the Residual Communications after the Alignment Phase.
J. Parallel Distrib. Comput. 38(2): 176-187 (1996) |
| 6 | | Michèle Dion,
Yves Robert:
Mapping Affine Loop Nests.
Parallel Computing 22(10): 1373-1397 (1996) |
| 5 | | Alain Darte,
Michèle Dion,
Yves Robert:
A Characterization of One-to-One Modular Mappings.
Parallel Processing Letters 6(1): 145-157 (1996) |
| 1995 |
|---|
| 4 |  | Michèle Dion,
Yves Robert:
Mapping affine loop nests: new results.
HPCN Europe 1995: 184-189 |
| 3 | | Michèle Dion,
Tanguy Risset,
Yves Robert:
Resource-constrained scheduling of partitioned algorithms on processor arrays.
PDP 1995: 571-580 |
| 1994 |
|---|
| 2 | | Michèle Dion,
Marc Gengler,
Stéphane Ubéda:
Comparing two Probabilistic Models of the Computational Complexity of the Branch and Bound Algorithm.
CONPAR 1994: 359-370 |
| 1 | | Michèle Dion,
Yves Robert,
Jean-Laurent Philippe:
Parallelizing Compilers: What Can Be Achieved?
HPCN 1994: 447-456 |
Data released under the ODC-BY 1.0 license — See also our legal information page