Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
http://www.fz-juelich.de/ias/jsc/EN/Expertise/Supercomputers/JUQUEEN/JUQUEEN_node.html
Frenkel, D., Smit, B.: Understanding Molecular Simulation: From Algorithms to Applications. Academic Press, San Diego (2002)
Grest, G.S., Dünweg, B., Kremer, K.: Vectorized link cell Fortran code for molecular dynamics siulations for large number of particles. Comput. Phys. Comm. 55, 269–285 (1989)
Hoover, W.G.: Smooth Particle Applied Mechanics. World Scientific, Singapore (2006)
Li, S., Liu, W.: Meshfree and particle methods and their applications. Appl. Mech. Rev. 55, 1–36 (2002)
Plimpton, S.: Fast parallel algorithms for short range molecular dynamics. J. Comput. Phys. 117, 1 (1995)
Rapaport, D.: The Art of Molecular Dynamics Simulation. Cambridge University Press, Cambridge (2001)
Sutmann, G.: Classical molecular dynamics. In: Grotendorst, J., Marx, D., Muramatsu, A. (eds.) Quantum Simulations of Many-body Systems: From Theory to Algorithm, vol. 10, pp. 211–254. NIC, Jülich (2002)
Sutmann, G., Stegailov, V.: Optimization of neighbor list techniques in liquid matter simulations. J. Mol. Liq. 125, 197–203 (2006)
Zurek, D., Pietron, M., Wielgosz, M., Wiatr, K.: The comparison of different sorting algorithms implemented on different hardware platforms. Comput. Sci. 14, 679–691 (2013)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Halver, R., Sutmann, G. (2016). Multi-threaded Construction of Neighbour Lists for Particle Systems in OpenMP. In: Wyrzykowski, R., Deelman, E., Dongarra, J., Karczewski, K., Kitowski, J., Wiatr, K. (eds) Parallel Processing and Applied Mathematics. Lecture Notes in Computer Science(), vol 9574. Springer, Cham. https://doi.org/10.1007/978-3-319-32152-3_15
Download citation
DOI: https://doi.org/10.1007/978-3-319-32152-3_15
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-32151-6
Online ISBN: 978-3-319-32152-3
eBook Packages: Computer ScienceComputer Science (R0)