English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  Code modernization strategies for short-range non-bonded molecular dynamics simulations

Vance, J., Xu, Z.-H., Tretyakov, N., Stuehn, T., Rampp, M., Eibl, S., et al. (2023). Code modernization strategies for short-range non-bonded molecular dynamics simulations. Computer Physics Communications, 290: 108760. doi:10.1016/j.cpc.2023.108760.

Item is

Files

show Files
hide Files
:
Code modernization strategies for short-range non-bonded molecular dynamics simulations.pdf (Any fulltext), 919KB
 
File Permalink:
-
Name:
Code modernization strategies for short-range non-bonded molecular dynamics simulations.pdf
Description:
-
OA-Status:
Visibility:
Private
MIME-Type / Checksum:
application/pdf
Technical Metadata:
Copyright Date:
-
Copyright Info:
-
License:
-

Locators

show

Creators

show
hide
 Creators:
Vance, James, Author
Xu, Zhen-Hao, Author
Tretyakov, Nikita, Author
Stuehn, Torsten, Author
Rampp, Markus1, Author           
Eibl, Sebastian1, Author           
Junghans, Christoph, Author
Brinkmann, André, Author
Affiliations:
1Max Planck Computing and Data Facility, Max Planck Society, ou_2364734              

Content

show
hide
Free keywords: -
 Abstract: Modern HPC systems are increasingly relying on greater core counts and wider vector registers. Thus, applications need to be adapted to fully utilize these hardware capabilities. One class of applications that can benefit from this increase in parallelism are molecular dynamics simulations. In this paper, we describe our efforts at modernizing the ESPResSo++ simulation package for molecular dynamics by restructuring its particle data layout for efficient memory accesses and applying vectorization techniques to benefit the calculation of short-range non-bonded forces, which results in an overall three times speedup and serves as a baseline for further optimizations. We also implement fine-grained parallelism for multi-core CPUs through HPX, a C++ runtime system which uses lightweight threads and an asynchronous many-task approach to maximize concurrency. Our goal is to evaluate the performance of an HPX-based approach compared to the bulk-synchronous MPI-based implementation. This requires the introduction of an additional layer to the domain decomposition scheme that defines the task granularity. On spatially inhomogeneous systems, which impose a corresponding load-imbalance in traditional MPI-based approaches, we demonstrate that by choosing an optimal task size, the efficient work-stealing mechanisms of HPX can overcome the overhead of communication resulting in an overall 1.4 times speedup compared to the baseline MPI version.

Details

show
hide
Language(s): eng - English
 Dates: 2023-05-032023-09
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: DOI: 10.1016/j.cpc.2023.108760
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: Computer Physics Communications
  Abbreviation : Comput. Phys. Commun.
Source Genre: Journal
 Creator(s):
Affiliations:
Publ. Info: Amsterdam : Elsevier B.V.
Pages: - Volume / Issue: 290 Sequence Number: 108760 Start / End Page: - Identifier: ISSN: 0010-4655
CoNE: https://pure.mpg.de/cone/journals/resource/954925392326