Please use this identifier to cite or link to this item:
https://zone.biblio.laurentian.ca/handle/10219/2700
Title: | Efficient parallelization of short-range molecular dynamics simulations on many-core systems |
Authors: | Meyer, Ralf |
Keywords: | molecular dynamics simulations;parallel computing |
Issue Date: | Nov-2013 |
Publisher: | American Physical Society |
Citation: | R. Meyer, Efficient parallelization of short-range molecular dynamics simulations on many-core systems, Phys. Rev. E 88, 053309 (2013). |
Abstract: | This article introduces a highly parallel algorithm for molecular dynamics simulations with short-range forces on single node multi- and many-core systems. The algorithm is designed to achieve high parallel speedups for strongly inhomogeneous systems like nanodevices or nanostructured materials. In the proposed scheme the calculation of the forces and the generation of neighbor lists are divided into small tasks. The tasks are then executed by a thread pool according to a dependent task schedule. This schedule is constructed in such a way that a particle is never accessed by two threads at the same time. Benchmark simulations on a typical 12-core machine show that the described algorithm achieves excellent parallel efficiencies above 80% for different kinds of systems and all numbers of cores. For inhomogeneous systems the speedups are strongly superior to those obtained with spatial decomposition. Further benchmarks were performed on an Intel Xeon Phi coprocessor. These simulations demonstrate that the algorithm scales well to large numbers of cores. |
Description: | © 2013 American Physical Society |
URI: | https://doi.org/10.1103/PhysRevE.88.053309 https://zone.biblio.laurentian.ca/handle/10219/2700 |
ISSN: | 1539-3755 |
Appears in Collections: | Articles Articles |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
PRE_88_053309.pdf | 802 kB | Adobe PDF | View/Open |
Items in LU|ZONE|UL are protected by copyright, with all rights reserved, unless otherwise indicated.