Eric Quémerais
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Eric Quémerais has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
- Bastien Andrieu
DMPE, ONERA, Université Paris-Saclay, 92320 Châtillon, France
4 shared publications - Bruno Maugars
DAAA, ONERA, Université Paris-Saclay, 92320 Châtillon, France
2 shared publications - Karmijn Hoogveld
DMPE, ONERA, Université Paris-Saclay, 92320 Châtillon, France
2 shared publications - Berenger Berthoul
DAAA, ONERA, Université Paris-Saclay, 92320 Châtillon, France
1 shared publication Bruno Maugars
ONERA/DAAA, Université Paris-Saclay, 92320 Châtillon, France
1 shared publication- Clément Benazet
DAAA, ONERA, Université Paris-Saclay, 92320 Châtillon, France
1 shared publication
Latest Publications
- Open Access
- 28 October 2026
- Published by The Open Journal in Journal of Open Source Software
- Vol. 11 (126) , 10483
ParaDiGM: Parallel Distributed General Mesh
- 28 October 2026
- Published by The Open Journal in Journal of Open Source Software
- Vol. 11 (126) , 10483
Open AccessParaDiGM: Parallel Distributed General Mesh
- Open Access
- 28 October 2026
- Published by The Open Journal in Journal of Open Source Software
- Vol. 11 (126) , 10424
CWIPI: Coupling With Interpolation Parallel Interface
- 28 October 2026
- Published by The Open Journal in Journal of Open Source Software
- Vol. 11 (126) , 10424
Open AccessCWIPI: Coupling With Interpolation Parallel Interface
- 3 February 2026
- Published by MathDoc/Centre Mersenne in Comptes Rendus Mécanique
- Vol. 354 (G1) , 53-70
Dynamic load-balanced point location algorithm for data mapping
Data mapping between geometric domains with non-matching discretizations is an essential step in multi-component numerical simulation workflows. This paper presents a novel point location algorithm, designed for transferring data from unstructured meshes to point clouds, in a massively parallel distributed environment. Special emphasis is placed on load balancing, which is paramount for making the most of computing resources and achieve optimal performance. In general, the geometric entities of interest are unevenly distributed in the input frame provided by the calling codes. The algorithm therefore aims to rapidly prune the search space using a series of parallel preconditioning techniques, while redistributing data equitably across all processes at each step. Exact point-in-cell location is then computed in an embarrassingly parallel, well-balanced frame. All data movements performed throughout the point location algorithm are transparent to the calling codes, as the resulting geometric and parallel mappings are returned in the same frame as the input data. These mappings enable data transfer via spatial interpolation and optimized process-to-process communications. A weak scaling study is carried out in three scenarios representative of the variety of real-life applications. Comparison with a state-of-the-art algorithm shows that the new algorithm performs better overall, with speed-ups of up to a factor of 10 on 4,800 CPU cores.
- 3 February 2026
- Published by MathDoc/Centre Mersenne in Comptes Rendus Mécanique
- Vol. 354 (G1) , 53-70
Dynamic load-balanced point location algorithm for data mapping
Data mapping between geometric domains with non-matching discretizations is an essential step in multi-component numerical simulation workflows. This paper presents a novel point location algorithm, designed for transferring data from unstructured meshes to point clouds, in a massively parallel distributed environment. Special emphasis is placed on load balancing, which is paramount for making the most of computing resources and achieve optimal performance. In general, the geometric entities of interest are unevenly distributed in the input frame provided by the calling codes. The algorithm therefore aims to rapidly prune the search space using a series of parallel preconditioning techniques, while redistributing data equitably across all processes at each step. Exact point-in-cell location is then computed in an embarrassingly parallel, well-balanced frame. All data movements performed throughout the point location algorithm are transparent to the calling codes, as the resulting geometric and parallel mappings are returned in the same frame as the input data. These mappings enable data transfer via spatial interpolation and optimized process-to-process communications. A weak scaling study is carried out in three scenarios representative of the variety of real-life applications. Comparison with a state-of-the-art algorithm shows that the new algorithm performs better overall, with speed-ups of up to a factor of 10 on 4,800 CPU cores.
- Open Access
- 3 June 2024
- Published by Association for Computing Machinery (ACM)
- p. 1-11
Hybrid Multi-GPU Distributed Octrees Construction for Massively Parallel Code Coupling Applications
This paper presents two new hybrid MPI-GPU algorithms for building distributed octrees. The first algorithm redistributes data between processes and is used to globally sort the points on which the octree is generated, according to their SFC codes. The second algorithm proposes a bottom-up approach to merge leaves from the maximum depth to their final level, ensuring that each leaf contains no more than Nmax points. This method is better suited for GPU implementation because it maximises parallelism from the beginning of the algorithm. The methods have been implemented in the CWIPI library to reduce the execution time of the point-in-mesh location algorithm, which is performed several times when moving non-coincident meshes are used. Tests on large cases have shown speedups of up to ×120 compared to a conventional CPU version, with scaling as good as the full CPU version.
- 3 June 2024
- Published by Association for Computing Machinery (ACM)
- p. 1-11
Open AccessHybrid Multi-GPU Distributed Octrees Construction for Massively Parallel Code Coupling Applications
This paper presents two new hybrid MPI-GPU algorithms for building distributed octrees. The first algorithm redistributes data between processes and is used to globally sort the points on which the octree is generated, according to their SFC codes. The second algorithm proposes a bottom-up approach to merge leaves from the maximum depth to their final level, ensuring that each leaf contains no more than Nmax points. This method is better suited for GPU implementation because it maximises parallelism from the beginning of the algorithm. The methods have been implemented in the CWIPI library to reduce the execution time of the point-in-mesh location algorithm, which is performed several times when moving non-coincident meshes are used. Tests on large cases have shown speedups of up to ×120 compared to a conventional CPU version, with scaling as good as the full CPU version.