Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Samuel Pitoiset

dblp:155/4963 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2017
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Parallel and multicore computing · 54% High-performance computing · 23% Performance modeling and evaluation · 23%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Performance modeling and evaluation › numerical algorithms
fast multipole method
0.312017
Bridging the Gap Between OpenMP and Task-Based Runtime Systems for the Fast Multipole Method · IEEE Trans. Parallel Distributed Syst. 2017
High-performance computing
numerical libraries
0.312017
Bridging the Gap Between OpenMP and Task-Based Runtime Systems for the Fast Multipole Method · IEEE Trans. Parallel Distributed Syst. 2017
Parallel and multicore computing › parallel programming models › task parallelism
OpenMP tasking
0.312017
Bridging the Gap Between OpenMP and Task-Based Runtime Systems for the Fast Multipole Method · IEEE Trans. Parallel Distributed Syst. 2017
Parallel and multicore computing › parallel programming runtimes
task-based runtime
0.312017
Bridging the Gap Between OpenMP and Task-Based Runtime Systems for the Fast Multipole Method · IEEE Trans. Parallel Distributed Syst. 2017
Parallel and multicore computing › parallel programming models
shared-memory parallelization
0.112017
Bridging the Gap Between OpenMP and Task-Based Runtime Systems for the Fast Multipole Method · IEEE Trans. Parallel Distributed Syst. 2017

Methods — techniques the papers use, named apart from their topics

task-based runtime · 0.3ScalFMM · 0.3OpenMP 4.0 · 0.3
YearPublicationVenuePosition
2017 Bridging the Gap Between OpenMP and Task-Based Runtime Systems for the Fast Multipole Method
abstract
With the advent of complex modern architectures, the low-level paradigms long considered sufficient to build High Performance Computing (HPC) numerical codes have met their limits. Achieving efficiency, ensuring portability, while preserving programming tractability on such hardware prompted the HPC community to design new, higher level paradigms while relying on runtime systems to maintain performance. However, the common weakness of these projects is to deeply tie applications to specific expert-only runtime system APIs. The OpenMP specification, which aims at providing common parallel programming means for shared-memory platforms, appears as a good candidate to address this issue thanks to the latest task-based constructs introduced in its revision 4.0. The goal of this paper is to assess the effectiveness and limits of this support for designing a high-performance numerical library, ScalFMM, implementing the fast multipole method (FMM) that we have deeply re-designed with respect to the most advanced features provided by OpenMP 4. We show that OpenMP 4 allows for significant performance improvements over previous OpenMP revisions on recent multicore processors and that extensions to the 4.0 standard allow for strongly improving the performance, bridging the gap with the very high performance that was so far reserved to expert-only runtime system APIs.
Emmanuel Agullo, Olivier Aumage, Bérenger Bramas, Olivier Coulaud, Samuel Pitoiset
IEEE Trans. Parallel Distributed Syst.5