2018
DOI: 10.1007/s11227-018-2272-2
|View full text |Cite
|
Sign up to set email alerts
|

A thread-level parallelization of pairwise additive potential and force calculations suitable for current many-core architectures

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2019
2019
2020
2020

Publication Types

Select...
2
1
1

Relationship

2
2

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 22 publications
0
2
0
Order By: Relevance
“…Calculation procedures in the P2P are just the same as in the original code, regardless of the branch type. So, our recently proposed thread‐level parallelization techniques of P2P suited for current many‐core architectures could be utilized for the present extended FMM algorithm. Calculation procedures in the M2L are the same as in the original code, whereas NnormalM2normalLL are not uniform at each L with the anisotropic partition tree as described in Section 2.1.4.…”
Section: Methodsmentioning
confidence: 99%
“…Calculation procedures in the P2P are just the same as in the original code, regardless of the branch type. So, our recently proposed thread‐level parallelization techniques of P2P suited for current many‐core architectures could be utilized for the present extended FMM algorithm. Calculation procedures in the M2L are the same as in the original code, whereas NnormalM2normalLL are not uniform at each L with the anisotropic partition tree as described in Section 2.1.4.…”
Section: Methodsmentioning
confidence: 99%
“…In contrast, in FMM, communications are mainly between adjacent computation nodes, and there are no all‐to‐all communications. Thus, a high efficiency can be achieved, even in a highly parallel environment …”
Section: Introductionmentioning
confidence: 99%