CoChat

An efficient and portable SIMD algorithm for charge/current deposition in Particle-In-Cell codes

Open access
Vincenti, H., Lobet, M., Lehe, R., Sasanka, R., Vay, J.-L. · 2017 · Computer Physics Communications

The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.

Abstract

Author(s): Vincenti, H; Lobet, M; Lehe, R; Sasanka, R; Vay, JL | Abstract: © 2016 In current computer architectures, data movement (from die to network) is by far the most energy consuming part of an algorithm (≈20pJ/word on-die to ≈10,000 pJ/word on the network). To increase memory locality at the hardware level and reduce energy consumption related to data movement, future exascale computers tend to use many-core processors on each compute nodes that will have a reduced clock speed to allow for efficient cooling. To compensate for frequency decrease, machine vendors are making use of long SIMD instruction registers that are able to process multiple data with one arithmetic operator in one clock cycle. SIMD register length is expected to double every four years. As a consequence, Particle-In-Cell (PIC) codes will have to achieve good vectorization to fully take advantage of these upcoming architectures. In this paper, we present a new algorithm that allows for efficient and portable SIMD vectorization of current/charge deposition routines that are, along with the field gathering routines, among the most time consuming parts of the PIC algorithm. Our new algorithm uses a particular data structure that takes into account memory alignment constraints and avoids gather/scatter instructions that can significantly affect vectorization performances on current CPUs. The new algorithm was successfully implemented in the 3D skeleton PIC code PICSAR and tested on Haswell Xeon processors (AVX2-256 bits wide data registers). Results show a factor of ×2 to ×2.5 speed-up in double precision for particle shape factor of orders 1–3. The new algorithm can be applied as is on future KNL (Knights Landing) architectures that will include AVX-512 instruction sets with 512 bits register lengths (8 doubles/16 singles). Program summary Program Title: vec_deposition Program Files doi:http://dx.doi.org/10.17632/nh77fv9k8c.1 Licensing provisions: BSD 3-Clause Programming language: Fortran 90 External routines/libraries: OpenMPg4.0 Nature of problem: Exascale architectures will have many-core processors per node with long vector data registers capable of performing one single instruction on multiple data during one clock cycle. Data register lengths are expected to double every four years and this pushes for new portable solutions for efficiently vectorizing Particle-In-Cell codes on these future many-core architectures. One of the main hotspot routines of the PIC algorithm is the current/charge deposition for which there is no efficient and portable vector algorithm. Solution method: Here we provide an efficient and portable vector algorithm of current/charge deposition routines that uses a new data structure, which significantly reduces gather/scatter operations. Vectorization is controlled using OpenMP 4.0 compiler directives for vectorization which ensures portability across different architectures. Restrictions: Here we do not provide the full PIC algorithm with an executable but only vector routines for current/charge deposition. These scalar/vector routines can be used as library routines in your 3D Particle-In-Cell code. However, to get the best performances out of vector routines you have to satisfy the two following requirements: (1) Your code should implement particle tiling (as explained in the manuscript) to allow for maximized cache reuse and reduce memory accesses that can hinder vector performances. The routines can be used directly on each particle tile. (2) You should compile your code with a Fortran 90 compiler (e.g Intel, gnu or cray) and provide proper alignment flags and compiler alignment directives (more details in README file).

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1016/j.cpc.2016.08.023

Cites

9 of 9 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 9 references

Research works printed but not linked: 2

  1. J.L. Schwarzmeier, T.G. Hewitt, Proceedings, 12th Conf. on Numerical Simulation of Plasmas, San Francisco, 1987.
  2. R.A. Fonseca, J. Vieira, F. Fiuza, A. Davidson, F.S. Tsung, W.B. Mori, L.O. Siva, ArXiv, http://arxiv.org/pdf/1310.0930v1.pdf, 2013. · arXiv

Cited by

See all 49

Metadata

Authors
Vincenti, H., Lobet, M., Lehe, R., Sasanka, R., & Vay, J.-L.
Affiliations
  • Lawrence Berkeley National Laboratory (US)
  • Intel (United States) (US)
Corresponding author
Vincenti, H.
Venue
Computer Physics Communications
Publisher
Elsevier BV
Published
2017-01
Volume
210
Pages
145-154
ISSN
0010-4655 (ISSN-L)
OpenAlex
W2238102822
Cited by
48
References
9
Citations by year
2026: 2 · 2025: 2 · 2024: 2 · 2023: 5 · 2022: 3 · 2021: 4 · 2020: 6 · 2019: 8 · 2018: 8 · 2017: 5
FWCI
12.12
Type
journal article
Language
en
Open access
Licence
Locations
  • Computer Physics Communications (acceptedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • eScholarship (California Digital Library) (submittedVersion)
  • OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) (submittedVersion)
  • HAL (submittedVersion)
  • arXiv (Cornell University)
Funders
  • Marie Curie IOF fellowship PICSSAR (624543)
  • Office of Science, Office of High Energy Physics, U.S. Dept. of Energy (DE-AC02-05CH11231)
  • US-DOE SciDAC program ComPASS
  • US-DOE program CAMPA
  • Office of Science of the U.S. Department of Energy (DE-AC02-05CH11231)
Topics
  • Physical Sciences › Computer Science › Hardware and Architecture › Parallel Computing and Optimization Techniques
  • Physical Sciences › Computer Science › Computer Graphics and Computer-Aided Design › Computer Graphics and Visualization Techniques
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Electromagnetic Scattering and Analysis
Keywords
SIMD vectorization, charge deposition, particle-in-cell code, vectorization, memory alignment, exascale computing, many-core processors, AVX-512, memory locality, Fortran 90, particle shape factor

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: An efficient and portable SIMD algorithm for charge/current deposition in Particle-In-Cell codes. https://app.cochat.ai/papers/10.1016/j.cpc.2016.08.023
The paper
Vincenti, H., Lobet, M., Lehe, R., Sasanka, R., & Vay, J.-L. (2017). An efficient and portable SIMD algorithm for charge/current deposition in Particle-In-Cell codes. Computer Physics Communications. https://doi.org/10.1016/j.cpc.2016.08.023

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.