2016
DOI: 10.1016/j.cpc.2016.03.008
|View full text |Cite
|
Sign up to set email alerts
|

Efficient parallelization of analytic bond-order potentials for large-scale atomistic simulations

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
12
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
4

Relationship

2
2

Authors

Journals

citations
Cited by 4 publications
(13 citation statements)
references
References 9 publications
1
12
0
Order By: Relevance
“…As a result, it is necessary to perform significant changes in the main initialization routines to provide the spatial subdivision of the array of atoms for each domain. Considering the use of equal orthogonal domains and the use of Cartesian processor topology given by the MPI implementation (Teijeiro et al, 2016a), the creation of subdomains follows the same approach: every MPI process defines the same internal three-dimensional Cartesian topology, so that every domain is subdivided into equal orthogonal subdomains. In order to provide an efficient processing of path computations, the main atom information associated with each subdomain is stored consecutively and is marked with a start and a stop index.…”
Section: Subdomain Algorithmmentioning
confidence: 99%
See 4 more Smart Citations
“…As a result, it is necessary to perform significant changes in the main initialization routines to provide the spatial subdivision of the array of atoms for each domain. Considering the use of equal orthogonal domains and the use of Cartesian processor topology given by the MPI implementation (Teijeiro et al, 2016a), the creation of subdomains follows the same approach: every MPI process defines the same internal three-dimensional Cartesian topology, so that every domain is subdivided into equal orthogonal subdomains. In order to provide an efficient processing of path computations, the main atom information associated with each subdomain is stored consecutively and is marked with a start and a stop index.…”
Section: Subdomain Algorithmmentioning
confidence: 99%
“…Additionally, every domain defines an overlap zone with its neighbour domains, so that every process stores this redundant information in order to perform a local computation of paths. The analysis of different algorithms has proven the possibility of avoiding redundant path computations and minimizing inter-process communications at the same time (Teijeiro et al, 2016a). However, this pure MPI approach exhibits some limitations in flexibility for an efficient exploitation of many-core systems.…”
Section: Previous Work and Motivationmentioning
confidence: 99%
See 3 more Smart Citations