Yann Barsamian

Laboratoire ICube
Pôle API
300 bd Sébastien Brant
CS 10413
F-67412 Illkirch Cedex

ybarsamian@unistra.fr















Positions

2014-Current PhD in Computer Science at the University of Strasbourg
2009-2014 Mathematics teacher in high school


Research

The main research topics for my thesis are: optimisation (loop optimisation, cache misses, communication-avoiding algorithms), parallelisation (MPI, OpenMP, vectorisation, scalability, MIC architectures), reproducibility, numerical simulations for plasma physics (two-species, Particle-in-Cell, Semi-Lagrangian).

My PhD advisors are Éric Violard, Michel Mehrenberger and Sever Hirstoaga.

My thesis is entitled "Parallelisation and optimisation of Semi-Lagrangian and particle methods for solving the Vlasov-Poisson system of equations".

Teaching

Some teaching material for the University of Strasbourg in computer science : https://moodle2.unistra.fr/ (you need an account at Strasbourg)

FRENCH : some teaching material for High School in mathematics (Seconde, Première, Terminale & BTS SIO) and computer science (BTS SIO) ; feel free to use it with your students : Seconde, Terminale S, Première STSS, Terminale ST2S and BTS SIO.

FRENCH : some teaching material for teachers in mathematics / computer science / geography ; feel free to use it : the link. Some of this material is part of the biannual Université d'été espace éducation of the Centre National d'Études Spatiales (CNES, Toulouse).

Publications

A Space and Bandwidth Efficient Multicore Algorithm for the Particle-in-Cell Method (Y. Barsamian, A. Charguéraud, and A. Ketterlin, 2017, PPAM 2017).
Springer link (yet to come), HAL link, presentation slides.

Efficient Data Structures for a Hybrid Parallel and Vectorized Particle-in-Cell Code (Y. Barsamian, S. Hirstoaga, and É. Violard, 2017, IPDPSW 2017).
IEEE link, HAL link, presentation slides.

PICSL : Semi-Lagrangian and Particle Methods for Solving the Vlasov Equation (Y. Barsamian, J. Bernier, S. Hirstoaga, M. Mehrenberger, and P. Navaro, 2016, CEMRACS 2016).
HAL link (yet to come), presentation slides.

Maximum Subarray Problem in 1D and 2D via Weighted Paths in Directed Acyclic Graphs (Y. Barsamian, 2016).
HAL link.