Parallel algorithms and architectures M Cosnard, P Quinton, Y Robert, M Tchuente | 166 | 1986 |

Random graph generation for scheduling simulations D Cordeiro, G Mounié, S Perarnau, D Trystram, JM Vincent, F Wagner | 154 | 2010 |

Efficient approximation algorithms for scheduling malleable tasks G Mounie, C Rapine, D Trystram Proceedings of the eleventh annual ACM symposium on Parallel algorithms and …, 1999 | 140 | 1999 |

Parallel Gaussian elimination on an MIMD computer M Cosnard, M Marrakchi, Y Robert, D Trystram Parallel Computing 6 (3), 275-296, 1988 | 139 | 1988 |

Algorithmes et architectures paralleles M Cosnard InterEditions, 1993 | 96 | 1993 |

Scheduling Parallel Tasks Approximation Algorithms. PF Dutot, G Mounié, D Trystram Handbook of scheduling, 2004 | 85 | 2004 |

Fair game-theoretic resource management in dedicated grids K Rzadca, D Trystram, A Wierzbicki Seventh IEEE International Symposium on Cluster Computing and the Grid …, 2007 | 83 | 2007 |

A ‐Approximation Algorithm for Scheduling Independent Monotonic Malleable Tasks G Mounie, C Rapine, D Trystram SIAM Journal on Computing 37 (2), 401-412, 2007 | 79 | 2007 |

Approximation algorithms for scheduling malleable tasks under precedence constraints R Lepère, D Trystram, GJ Woeginger International Journal of Foundations of Computer Science 13 (04), 613-627, 2002 | 72 | 2002 |

Handbook on parallel and distributed processing J Blazewicz, K Ecker, B Plateau, D Trystram Springer Science & Business Media, 2013 | 70 | 2013 |

Improving backfilling by using machine learning to predict running times E Gaussier, D Glesser, V Reis, D Trystram SC'15: Proceedings of the International Conference for High Performance …, 2015 | 67 | 2015 |

Malleable preemptable tasks TD Błażewicz Jacek, Machowiak Maciej, Węglarz Jan, Kovalyov Michai IEEE Transactions on Computers 55 (4), 2006 | 63* | 2006 |

A flexible checkpoint/restart model in distributed systems MS Bouguerra, T Gautier, D Trystram, JM Vincent International Conference on Parallel Processing and Applied Mathematics, 206-215, 2009 | 61 | 2009 |

Bell's theorem: the naive view of an experimentalist A Aspect arXiv preprint quant-ph/0402001, 2004 | 59* | 2004 |

Scheduling malleable tasks on parallel processors to minimize the makespan J Blazewicz, M Machowiak, J Weglarz, MY Kovalyov, D Trystram Annals of Operations Research 129 (1-4), 65, 2004 | 57 | 2004 |

Bi-criteria algorithm for scheduling jobs on cluster platforms PF Dutot, L Eyraud, G Mounié, D Trystram Proceedings of the sixteenth annual ACM symposium on Parallelism in …, 2004 | 57 | 2004 |

Minimizing total weighted error for imprecise computation tasks and related problems JYT Leung Handbook of Scheduling 34, 2004 | 56* | 2004 |

Sensitivity analysis of scheduling algorithms B Penz, C Rapine, D Trystram European Journal of Operational Research 134 (3), 606-615, 2001 | 55 | 2001 |

Scheduling a divisible task in a two-dimensional toroidal mesh J Błażewicz, M Drozdowski, F Guinand, D Trystram Discrete Applied Mathematics 94 (1-3), 35-50, 1999 | 55 | 1999 |

Systolic solution of the algebraic path problem Y Robert, D Trystram Systolic Arrays, 171-180, 1987 | 53 | 1987 |