Some parallel algorithms for the Quasineutrality solver of GYSELA

Guillaume Latu 1, 2 Virginie Grandgirard 1 Nicolas Crouseilles 3, 4 Radoin Belaouar 3 Eric Sonnendrücker 3
4 CALVI - Scientific computation and visualization
IRMA - Institut de Recherche Mathématique Avancée, LSIIT - Laboratoire des Sciences de l'Image, de l'Informatique et de la Télédétection, Inria Nancy - Grand Est, IECL - Institut Élie Cartan de Lorraine
Abstract : 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.
Complete list of metadatas

Cited literature [2 references]  Display  Hide  Download

https://hal.inria.fr/inria-00583521
Contributor : Guillaume Latu <>
Submitted on : Tuesday, April 5, 2011 - 11:41:23 PM
Last modification on : Monday, October 1, 2018 - 4:03:03 PM
Long-term archiving on : Thursday, November 8, 2012 - 1:30:51 PM

File

RR-7591.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00583521, version 1

Citation

Guillaume Latu, Virginie Grandgirard, Nicolas Crouseilles, Radoin Belaouar, Eric Sonnendrücker. Some parallel algorithms for the Quasineutrality solver of GYSELA. [Research Report] RR-7591, INRIA. 2011, pp.15. ⟨inria-00583521⟩

Share

Metrics

Record views

546

Files downloads

202