activity
20122024
most citedA Novel Hybrid Quicksort Algorithm Vectorized using AVX-512 on Intel Skylake

49 citations · 105 across the 13 of their papers we have counts for

collaborators

14 papers

cs.DC2024

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…

cs.DC2023★ 1 cited

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…

cs.DC2023

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…

cs.DC2023

Autovesk: Automatic vectorized code generation from unstructured static kernels using graph transformations

Hayfa Tayeb, Ludovic Paillat, Berenger Bramas

Leveraging the SIMD capability of modern CPU architectures is mandatory to take full benefit of their increasing performance. To exploit this feature, binary executables must be ex…

physics.flu-dyn2021★ 15 cited

An Efficient Particle Tracking Algorithm for Large-Scale Parallel Pseudo-Spectral Simulations of Turbulence

Cristian C. Lalescu, Bérenger Bramas, Markus Rampp +1

Particle tracking in large-scale numerical simulations of turbulent flows presents one of the major bottlenecks in parallel performance and scaling efficiency. Here, we describe a…

cs.DC2021

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…

cs.DC2021

A fast vectorized sorting implementation based on the ARM scalable vector extension (SVE)

Bérenger Bramas

The way developers implement their algorithms and how these implementations behave on modern CPUs are governed by the design and organization of these. The vectorization units (SIM…

cs.DC2020★ 1 cited

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…

math.NA2019★ 4 cited

An Integral Equation Formulation of the -body Dielectric Spheres Problem. Part II: Complexity Analysis

Bérenger Bramas, Muhammad Hassan, Benjamin Stamm

This article is the second in a series of two papers concerning the mathematical study of a boundary integral equation of the second kind that describes the interaction of diel…

cs.DC2018★ 11 cited

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…

cs.DC2018

Computing the sparse matrix vector product using block-based kernels without zero padding on processors with AVX-512 instructions

Berenger Bramas, Pavel Kus

The sparse matrix-vector product (SpMV) is a fundamental operation in many scientific applications from various fields. The High Performance Computing (HPC) community has therefore…

cs.MS2017★ 49 cited

A Novel Hybrid Quicksort Algorithm Vectorized using AVX-512 on Intel Skylake

Berenger Bramas

The modern CPU's design, which is composed of hierarchical memory and SIMD/vectorization capability, governs the potential for algorithms to be transformed into efficient implement…

math.NA2012★ 19 cited

Optimized M2L Kernels for the Chebyshev Interpolation based Fast Multipole Method

Matthias Messner, Bérenger Bramas, Olivier Coulaud +1

A fast multipole method (FMM) for asymptotically smooth kernel functions (1/r, 1/r^4, Gauss and Stokes kernels, radial basis functions, etc.) based on a Chebyshev interpolation sch…

cs.DC2012★ 5 cited

Pipelining the Fast Multipole Method over a Runtime System

Emmanuel Agullo, Béranger Bramas, Olivier Coulaud +3

Fast Multipole Methods (FMM) are a fundamental operation for the simulation of many physical problems. The high performance design of such methods usually requires to carefully tun…