Some parallel algorithms for the Quasineutrality solver of GYSELA

The very first parallelizations of the quasineutrality Poisson solver used in the GYSELA code are presented here. We investigate some numerical schemes. For each considered scheme, we propose an algorithmic decomposition in term of parallel computations and inter-processor communications. A set of benchmarks on a parallel machine has permitted to evaluate the performance of the different versions of the Quasineutrality solver.