Exploiting Parallelism on Shared Memory in the QED Particle-in-Cell Code PICADOR with Greedy Load Balancing
Iosif Meyerov, Sergei Bastrakov, Aleksei Bashinov, Evgeny Efimenko,, Alexander Panov, Elena Panova, Igor Surmin, Valentin Volokitin, and Arkady, Gonoskov

TL;DR
This paper introduces a dynamic load balancing scheme for shared memory systems in QED Particle-in-Cell simulations, significantly improving computational efficiency on modern supercomputers.
Contribution
It presents a novel load balancing approach for shared memory architectures in PIC simulations, enhancing resource utilization and performance in QED cascade modeling.
Findings
Outperforms previous schemes by 2.1 to 10 times on multi-core CPUs.
Effective in 1D, 2D, and 3D QED simulations.
Demonstrates scalability and efficiency improvements.
Abstract
State-of-the-art numerical simulations of laser plasma by means of the Particle-in-Cell method are often extremely computationally intensive. Therefore there is a growing need for development of approaches for efficient utilization of resources of modern supercomputers. In this paper, we address the problem of a substantially non-uniform and dynamically varying distribution of macroparticles in a computational area in simulating quantum electrodynamic (QED) cascades. We propose and evaluate a load balancing scheme for shared memory systems, which allows subdividing individual cells of the computational domain into work portions with subsequent dynamic distribution of these portions between OpenMP threads. Computational experiments on 1D, 2D, and 3D QED simulations show that the proposed scheme outperforms the previously developed standard and custom schemes in the PICADOR code by 2.1 to…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
