Olivier Beaumont

Also published under:O. Beaumont

Affiliation

Inria Center, University of Bordeaux, Talence, France

Topic

Load Balancing,Chameleon,Cholesky Decomposition,Communication Cost,Communication Volume,Computational Resources,Data Distribution,Data Transfer,Deep Neural Network,Increase In Throughput,LU Factorization,Linear Algebra,Lower Bound,Matrix Size,Multi-core,Neural Network,Pipelining,Symmetric Distribution,Allocation Scheme,Arithmetic Operations,Artificial Intelligence Machine Learning,Assignment Of Cells,Asymptotic Results,Autonomous Vehicles,Backward Propagation,Balanced Pattern,Batch Size,Bipartite Matching,C Elements,CPU Resources,Cold Start,Communication Constraints,Computation Time,Computational Graph,Computational Load,Computational Platform,Computing Nodes,Deep Neural Network Inference,Deep Neural Network Model,Definite Matrix,Delicate Issue,Dense Linear Algebra,Density Case,Deployment Model,Development Challenges,Distribution Strategy,Dynamic Adjustment,Dynamic Programming,Dynamic Programming Algorithm,Dynamic Scheduling,

Biography

Olivier Beaumont received the PhD degree from the Université de Rennes in January 1999. He is currently an associate professor in the LaBRI laboratory in Bordeaux. His main research interests are parallel algorithms on distributed memory architectures.