Efficient data layouts for a three-dimensional electrostatic Particle-in-Cell code

Efficient parallelization for 3d-3v sparse grid Particle-In-Cell: Shared memory architectures

“…This is thus a trade-off between the cost of re-sorting the particle population and increasing the cache-miss rate during iterations. Different elaborated data structures are proposed to alleviate the cost of the periodic particle sorting (see [4,44] and [5,6]). Another approach to mitigate the randomness of the memory accesses is to consider domain decomposition [19,42,45] with subdomains so small that they can fit in the cache system.…”