Optimization of PIC codes by improved memory management

DOI10.1016/j.jcp.2007.01.002zbMath1343.76058OpenAlexW2016636268MaRDI QIDQ2381178

Yanyan Li

Publication date: 14 September 2007

Published in: Journal of Computational Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcp.2007.01.002

zbMATH Keywords

Monte Carlobinary collisionparticle-in-cell (PIC) codes

Mathematics Subject Classification ID

Particle methods and lattice-gas methods (76M28)

Related Items (6)

Space-only hyperbolic approximation of the Vlasov equation ⋮ Lagrangian/Eulerian solvers and simulations for Vlasov-Poisson ⋮ Parallelization and optimization of electrostatic particle-in-cell/Monte-Carlo coupled codes as applied to RF discharges ⋮ Efficient 6D Vlasov simulation using the dynamical low-rank framework \texttt{Ensign} ⋮ Efficient parallelization for 3d-3v sparse grid particle-in-cell: shared memory architectures ⋮ Data parallelization algorithms for the direct simulation Monte Carlo method for rarefied gas flows on the basis of OpenMP technology

Cites Work

• Unnamed Item
• A treecode algorithm for simulating electron dynamics in a Penning-Malmberg trap
• Simultaneous potential and circuit solution for 1D bounded plasma particle simulation codes
• A binary collision model for plasma simulation with a particle code
• Hybrid ordered particle simulation (HOPS) code for plasma modelling on vector-serial, vector-parallel, and massively parallel computers
• Skeleton PIC codes for parallel computers
• Vector implementation of nonlinear Monte Carlo Coulomb collisions
• Accelerating a particle-in-cell simulation using a hybrid counting sort

This page was built for publication: Optimization of PIC codes by improved memory management