Skip to main content
SpringerLink
Log in

Multi-threaded Construction of Neighbour Lists for Particle Systems in OpenMP

  • Conference paper
  • First Online:
Book cover Parallel Processing and Applied Mathematics

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9574))

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 to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. http://openmp.org/wp/openmp-specifications/

  2. http://www.fz-juelich.de/ias/jsc/EN/Expertise/Supercomputers/JUQUEEN/JUQUEEN_node.html

  3. http://www.fz-juelich.de/ias/jsc/EN/Research/HPCTechnology/ClusterComputing/JUROPA-3/JUROPA-3_node.html

  4. Frenkel, D., Smit, B.: Understanding Molecular Simulation: From Algorithms to Applications. Academic Press, San Diego (2002)

    MATH  Google Scholar 

  5. 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)

    Article  Google Scholar 

  6. Hoover, W.G.: Smooth Particle Applied Mechanics. World Scientific, Singapore (2006)

    MATH  Google Scholar 

  7. Li, S., Liu, W.: Meshfree and particle methods and their applications. Appl. Mech. Rev. 55, 1–36 (2002)

    Article  Google Scholar 

  8. Plimpton, S.: Fast parallel algorithms for short range molecular dynamics. J. Comput. Phys. 117, 1 (1995)

    Article  MATH  Google Scholar 

  9. Rapaport, D.: The Art of Molecular Dynamics Simulation. Cambridge University Press, Cambridge (2001)

    MATH  Google Scholar 

  10. 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)

    Google Scholar 

  11. Sutmann, G., Stegailov, V.: Optimization of neighbor list techniques in liquid matter simulations. J. Mol. Liq. 125, 197–203 (2006)

    Article  Google Scholar 

  12. 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)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Jülich Supercomputing Centre (JSC), Institute for Advanced Simulation (IAS), Forschungszentrum Jülich (JSC), 52425, Jülich, Germany

    Rene Halver & Godehard Sutmann

  2. ICAMS, Ruhr-University Bochum, 44801, Bochum, Germany

    Godehard Sutmann

Authors
  1. Rene Halver
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Godehard Sutmann
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Godehard Sutmann .

Editor information

Editors and Affiliations

  1. Czestochowa University of Technolog, Czestochowa, Poland

    Roman Wyrzykowski

  2. Department of Computer Science, University of Southern California, Marina Del Rey, California, USA

    Ewa Deelman

  3. Electrical Engineering & Comput. Science, University of Tennessee, Knoxville, Tennessee, USA

    Jack Dongarra

  4. Czestochowa University of Technology, Institute of Computer & Information Sci., Czestochowa, Poland

    Konrad Karczewski

  5. Department of Computer Science, AGH University of Science and Technology, Krakow, Poland

    Jacek Kitowski

  6. Systèmes d’informations, Big Data et Rec, AGH University of Science and Technology, Krakow, Poland

    Kazimierz Wiatr

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics

Search

Navigation