Adaptive SIMD optimizations in particle-in-cell codes with fine-grain particle sorting

DOI10.1016/j.cpc.2019.05.001OpenAlexW2896965056WikidataQ127708861 ScholiaQ127708861MaRDI QIDQ2696529

Yanyan Li

Publication date: 14 April 2023

Published in: Computer Physics Communications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1810.03949

zbMATH Keywords

sortingplasma physicsparticle-in-cell (PIC)SIMD vectorization

Mathematics Subject Classification ID

Computer science (68-XX) Quantum theory (81-XX)

Related Items (1)

Efficient parallelization for 3d-3v sparse grid particle-in-cell: shared memory architectures

Cites Work

• A binary collision model for plasma simulation with a particle code
• An efficient and portable SIMD algorithm for charge/current deposition in particle-in-cell codes
• Numerical solution of initial boundary value problems involving maxwell's equations in isotropic media
• Exact charge conservation scheme for particle-in-cell simulation with an arbitrary form-factor
• Accelerating a particle-in-cell simulation using a hybrid counting sort
• \textsc{Smilei} : a collaborative, open-source, multi-purpose particle-in-cell code for plasma simulation
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Adaptive SIMD optimizations in particle-in-cell codes with fine-grain particle sorting