| Bell’s theorem: the naive view of an experimentalist A Aspect Quantum [un] speakables, 119-153, 2002 | 189 | 2002 |
| Parallel algorithms and architectures M Cosnard, P Quinton, Y Robert, M Tchuente North Holland, 1986 | 175 | 1986 |
| Random graph generation for scheduling simulations D Cordeiro, G Mounié, S Perarnau, D Trystram, JM Vincent, F Wagner 3rd International ICST Conference on Simulation Tools and Techniques …, 2010 | 164 | 2010 |
| Parallel Gaussian elimination on an MIMD computer M Cosnard, M Marrakchi, Y Robert, D Trystram Parallel Computing 6 (3), 275-296, 1988 | 146 | 1988 |
| 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 | 142 | 1999 |
| Algorithmes et architectures paralleles M Cosnard InterEditions, 1993 | 99 | 1993 |
| 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 | 87 | 2007 |
| Scheduling parallel tasks: Approximation algorithms PF Dutot, G Mounié, D Trystram Handbook of scheduling: Algorithms, models, and performance analysis, 26-1-26-24, 2004 | 85 | 2004 |
| Scheduling malleable tasks on parallel processors to minimize the makespan J Błażewicz, M Machowiak, J Węglarz, MY Kovalyov, D Trystram Annals of Operations Research 129 (1), 65-80, 2004 | 82 | 2004 |
| A ‐Approximation Algorithm for Scheduling Independent Monotonic Malleable Tasks G Mounie, C Rapine, D Trystram SIAM Journal on Computing 37 (2), 401-412, 2007 | 80 | 2007 |
| 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 | 78 | 2015 |
| 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 | 77 | 2002 |
| Handbook on parallel and distributed processing J Blazewicz, K Ecker, B Plateau, D Trystram Springer Science & Business Media, 2013 | 70 | 2013 |
| 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 | 66 | 2009 |
| Malleable preemptable tasks TD Błażewicz Jacek, Machowiak Maciej, Węglarz Jan, Kovalyov Michai IEEE Transactions on Computers 55 (4), 2006 | 63* | 2006 |
| Minimizing total weighted error for imprecise computation tasks and related problems J Leung Handbook of scheduling: algorithms, models, and performance analysis, 34-1-34-16, 2004 | 60* | 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 | 58 | 2004 |
| 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 | 57 | 1999 |
| Sensitivity analysis of scheduling algorithms B Penz, C Rapine, D Trystram European Journal of Operational Research 134 (3), 606-615, 2001 | 55 | 2001 |
| Reliability versus performance for critical applications A Girault, E Saule, D Trystram Journal of Parallel and Distributed Computing 69 (3), 326-336, 2009 | 54 | 2009 |
