Suivre
Olivier Beaumont
Olivier Beaumont
INRIA Bordeaux Sud-Ouest
Adresse e-mail validée de labri.fr - Page d'accueil
Titre
Citée par
Citée par
Année
Scheduling strategies for master-slave tasking on heterogeneous processor platforms
C Banino, O Beaumont, L Carter, J Ferrante, A Legrand, Y Robert
IEEE Transactions on Parallel and Distributed Systems 15 (4), 319-330, 2004
2442004
Matrix multiplication on heterogeneous platforms
O Beaumont, V Boudet, F Rastello, Y Robert
IEEE Transactions on Parallel and Distributed Systems 12 (10), 1033-1051, 2001
2422001
Matrix multiplication on heterogeneous platforms
O Beaumont, V Boudet, F Rastello, Y Robert
IEEE Transactions on Parallel and Distributed Systems 12 (10), 1033-1051, 2001
2422001
Scheduling divisible loads on star and tree networks: results and open problems
O Beaumont, H Casanova, A Legrand, Y Robert, Y Yang
IEEE Transactions on Parallel and Distributed Systems 16 (3), 207-218, 2005
2092005
Bandwidth-centric allocation of independent tasks on heterogeneous platforms
O Beaumont, L Carter, J Ferrante, A Legrand, Y Robert
Proceedings 16th International Parallel and Distributed Processing Symposium …, 2002
1732002
The master-slave paradigm with heterogeneous processors
O Beaumont, A Legrand, Y Robert
IEEE Transactions on Parallel and Distributed Systems 14 (9), 897-908, 2003
1332003
A proposal for a heterogeneous cluster ScaLAPACK (dense linear solvers)
O Beaumont, V Boudet, A Petitet, F Rastello, Y Robert
IEEE Transactions on Computers 50 (10), 1052-1070, 2001
1312001
Centralized versus distributed schedulers for bag-of-tasks applications
O Beaumont, L Carter, J Ferrante, A Legrand, L Marchal, Y Robert
IEEE Transactions on Parallel and Distributed Systems 19 (5), 698-709, 2008
1062008
Scheduling divisible workloads on heterogeneous platforms
O Beaumont, A Legrand, Y Robert
Parallel computing 29 (9), 1121-1152, 2003
1032003
Optimal algorithms for scheduling divisible workloads on heterogeneous systems
O Beaumont, A Legrand, Y Robert
Proceedings International Parallel and Distributed Processing Symposium, 14 pp., 2003
962003
A realistic model and an efficient heuristic for scheduling with heterogeneous processors
O Beaumont, V Boudet, Y Robert
Proceedings 16th International Parallel and Distributed Processing Symposium …, 2002
922002
VoroNet: A scalable object network based on Voronoi tessellations
O Beaumont, AM Kermarrec, L Marchal, É Rivière
2007 IEEE International Parallel and Distributed Processing Symposium, 1-10, 2007
792007
Steady-state scheduling on heterogeneous clusters
O Beaumont, A Legrand, L Marchal, Y Robert
International Journal of Foundations of Computer Science 16 (02), 163-194, 2005
752005
Pipelining broadcasts on heterogeneous platforms
O Beaumont, A Legrand, L Marchal, Y Robert
IEEE Transactions on Parallel and Distributed Systems 16 (4), 300-313, 2005
742005
Partitioning a square into rectangles: NP-completeness and approximation algorithms
Beaumont, Boudet, Rastello
Algorithmica 34, 217-239, 2002
732002
Are static schedules so bad? a case study on cholesky factorization
E Agullo, O Beaumont, L Eyraud-Dubois, S Kumar
2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS …, 2016
612016
Heterogeneous resource allocation under degree constraints
O Beaumont, L Eyraud-Dubois, CT Caro, H Rejeb
IEEE Transactions on Parallel and Distributed Systems 24 (5), 926-937, 2012
602012
The iso-level scheduling heuristic for heterogeneous processors
O Beaumont, V Boudet, Y Robert
10th Euromicro Workshop on Parallel, Distributed and Network-based …, 2002
552002
Assessing the impact and limits of steady-state scheduling for mixed task and data parallelism on heterogeneous platforms
O Beaumont, A Legrand, L Marchal, Y Robert
Third International Symposium on Parallel and Distributed Computing/Third …, 2004
512004
Peer to peer multidimensional overlays: Approximating complex structures
O Beaumont, AM Kermarrec, É Rivière
International Conference On Principles Of Distributed Systems, 315-328, 2007
482007
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20