Abstract
We describe the parallel full-f gyrokinetic particle-in-cell plasma simulation code ELMFIRE and the issue of solving an electrostatic potential from particle data distributed across several MPI (Message Passing Interface) processes. The potential is solved through a linear system with a strongly sparse matrix and ELMFIRE stores data of the estimated non-zero diagonals of the whole matrix in every MPI process. We present and compare several memory efficient structures for gathering the matrix data while keeping only a local part of the matrix in each process. We also demonstrate that these alternative structures improve scalability, thus enabling ELMFIRE to use more MPI processes and a finer time and space scale than before without sacrificing performance. (C) 2008 Elsevier B.V. All rights reserved.
Original language | Undefined/Unknown |
---|---|
Pages (from-to) | 330–338 |
Number of pages | 9 |
Journal | Computer Physics Communications |
Volume | 179 |
Issue number | 5 |
DOIs | |
Publication status | Published - 2008 |
MoE publication type | A1 Journal article-refereed |
Keywords
- full-f
- gyrokinetics
- matrix assembly
- plasma simulation
- sparse matrix