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

Yvan Fournier

dblp:95/10522 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 2017
0000-0001-5271-007XORCID · corroborated

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

Systems, architecture and hardware · 2 · 1 first-author

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
High-performance computing · 50% Performance modeling and evaluation · 50%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational science and engineering · 100%

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

TopicWeightPapersLastEvidence papers
Computational science and engineering
uncertainty quantification
0.312017
Melissa: large scale in transit sensitivity analysis avoiding intermediate files · SC 2017
High-performance computing
in transit processing
0.312017
Melissa: large scale in transit sensitivity analysis avoiding intermediate files · SC 2017
Performance modeling and evaluation › statistical analysis
sensitivity analysis
0.312017
Melissa: large scale in transit sensitivity analysis avoiding intermediate files · SC 2017

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

iterative statistics · 0.6in transit processing · 0.6
YearPublicationVenuePosition
2017 Melissa: large scale in transit sensitivity analysis avoiding intermediate files
abstract
Global sensitivity analysis is an important step for analyzing and validating numerical simulations. One classical approach consists in computing statistics on the outputs from well-chosen multiple simulation runs. Simulation results are stored to disk and statistics are computed postmortem. Even if supercomputers enable to run large studies, scientists are constrained to run low resolution simulations with a limited number of probes to keep the amount of intermediate storage manageable. In this paper we propose a file avoiding, adaptive, fault tolerant and elastic framework that enables high resolution global sensitivity analysis at large scale. Our approach combines iterative statistics and in transit processing to compute Sobol' indices without any intermediate storage. Statistics are updated on-the-fly as soon as the in transit parallel server receives results from one of the running simulations. For one experiment, we computed the Sobol' indices on 10M hexahedra and 100 timesteps, running 8000 parallel simulations executed in 1h27 on up to 28672 cores, avoiding 48TB of file storage.
Théophile Terraz, Alejandro Ribés, Yvan Fournier, Bertrand Iooss, Bruno Raffin
SC3
2013 Multiple threads and parallel challenges for large simulations to accelerate a general Navier-Stokes CFD code on massively parallel systems
abstract
SUMMARY Computational fluid dynamics is an increasingly important application domain for computational scientists. In this paper, we propose and analyze optimizations necessary to run CFD simulations consisting of multibillion‐cell mesh models on large processor systems. Our investigation leverages the general industrial Navier–Stokes CFD application, Code_Saturne, developed by Electricité de France for incompressible and nearly compressible flows. In this paper, we outline the main bottlenecks and challenges for massively parallel systems and emerging processor features such as many‐core, transactional memory, and thread level speculation. We also present an approach based on an octree search algorithm to facilitate the joining of mesh parts and to build complex larger unstructured meshes of several billion grid cells. We describe two parallel strategies of an algebraic multigrid solver and we detail how to introduce new levels of parallelism based on compiler directives with OpenMP, transactional memory and thread level speculation, for finite volume cell‐centered formulation and face‐based loops. A renumbering scheme for mesh faces is proposed to enhance thread‐level parallelism. Copyright © 2012 John Wiley & Sons, Ltd.
Yvan Fournier, Jérôme Bonelle, Pascal Vezolle, Jerry Heyman, Bruce D'Amora, Karen A. Magerlein, John Magerlein, Gordon W. Braudaway, Charles Moulinec, Andrew G. Sunderland
Concurr. Comput. Pract. Exp.1
2010 Accelerating Computational Fluid Dynamics on the IBM Blue Gene/P Supercomputer
abstract
Computational Fluid Dynamics (CFD) is an increasingly important application domain for computational scientists. In this paper, we propose and analyze optimizations necessary to run CFD simulations consisting of multi-billion-cell mesh models on large processor systems. Our investigation leverages the general industrial Navier-Stokes open-source CFD application, Code_Saturne, developed by Electricité de France (EDF). Our work considers emerging processor features such as many-core, Symmetric Multi-threading (SMT), Single Instruction Multiple Data (SIMD), Transactional Memory, and Thread Level Speculation. Initially, we have targeted per-node performance improvements by reconstructing the code and data layouts to optimally use multiple threads. We present a general loop transformation that will enable the compiler to generate OpenMP threads effectively with minimal impact to overall code structure. A renumbering scheme for mesh faces is proposed to enhance thread-level parallelism and generally improve data locality. Performance results on IBM Blue Gene/P supercomputer and Intel Xeon Westmere cluster are included.
Pascal Vezolle, Jerry Heyman, Bruce D'Amora, Gordon W. Braudaway, Karen A. Magerlein, John Magerlein, Yvan Fournier
SBAC-PAD7