1 citations · 1 across the 3 of their papers we have counts for
6 papers · 1 filter
Efficient GPU Implementation of Particle Interactions with Cutoff Radius and Few Particles per Cell
David Algis, Berenger Bramas, Emmanuelle Darles +1
This paper presents novel approaches to parallelizing particle interactions on a GPU when there are few particles per cell and the interactions are limited by a cutoff distance. Th…
Specx: a C++ task-based runtime system for heterogeneous distributed architectures
Paul Cardosi, Bérenger Bramas
Parallelization is needed everywhere, from laptops and mobile phones to supercomputers. Among parallel programming models, task-based programming has demonstrated a powerful potent…
SPC5: an efficient SpMV framework vectorized using ARM SVE and x86 AVX-512
Evann Regnault, Berenger Bramas
The sparse matrix/vector product (SpMV) is a fundamental operation in scientific computing. Having access to an efficient SpMV implementation is therefore critical, if not mandator…
Automatic task-based parallelization of C++ applications by source-to-source transformations
Garip Kusoglu, Berenger Bramas, Stephane Genaud
Currently, multi/many-core CPUs are considered standard in most types of computers including, mobile phones, PCs or supercomputers. However, the parallelization of applications as…
On the improvement of the in-place merge algorithm parallelization
Berenger Bramas, Quentin Bramas
In this paper, we present several improvements in the parallelization of the in-place merge algorithm, which merges two contiguous sorted arrays into one with an O(T) space complex…
Increasing the Degree of Parallelism Using Speculative Execution in Task-based Runtime Systems
Bérenger Bramas
Task-based programming models have demonstrated their efficiency in the development of scientific applications on modern high-performance platforms. They allow delegation of the ma…