Multi-threaded construction of neighbour lists for particle systems in OpenMP
R. Halver, G. Sutmann.R. Wyrzykowski, E. Deelman, J. Dongarra, K. Karczewski, J. Kitowski, K. Wiatr,
Parallel Processing and Applied Mathematics, Springer Int. Publ. Switzerland, Cham, 9574, 153-165, (2016)
The construction of neighbour lists based on the linked cell method is investigated in the context of particle simulation methods within the OpenMP shared memory programming model. Various implementations are studied which avoid memory collisions and race conditions. Performance and optimisation considerations are made along with run time behaviour and memory requirements. Performance models are proposed, which reproduce the measured runtime behaviour and which provide insight into the performance dependence on specific system parameters. Benchmarks are performed for different implementations on a number of multi-core architectures and thread numbers up to 240 are considered on the Xeon Phi architecture in the SMT mode, so that performance can be studied for a large number of threads working concurrently on the construction of linked cells on a shared memory partition.
Keyword(s): Race Condition, Neighbour List, Single Thread, Execution Time
Cite as: https://link.springer.com/chapter/10.1007%2F978-3-319-32152-3_15