TY - JOUR
T1 - Parallel computing of three-dimensional discontinuous deformation analysis based on OpenMP
AU - Peng, Xinyan
AU - Chen, Guangqi
AU - Yu, Pengcheng
AU - Zhang, Yingbin
AU - Guo, Longxiao
AU - Wang, Cungen
AU - Cheng, Xiao
AU - Niu, Hui
N1 - Funding Information:
This work was supported by the SKLGP open fund ( SKLGP2018K009 ), JSPS KAKENHI (grant numbers JP15K12483 , JP16F16056 , and JP15H01797 ), the National Natural Science Foundation of China (grant numbers 41672286 and 51408511 ), Science & Technology Department of Sichuan Province (grant number 2017JQ0042 ), the Japanese Government (MEXT) Scholarship Program , and the China Scholarship Council (CSC) . Additionally, this work was partly supported by the co-research project conducted by Kyushu University and W-NEXCO. The financial supports are gratefully acknowledged. We also appreciate the editor and anonymous reviewers for their useful suggestions that greatly improved the manuscript.
Funding Information:
This work was supported by the SKLGP open fund (SKLGP2018K009), JSPS KAKENHI (grant numbers JP15K12483, JP16F16056, and JP15H01797), the National Natural Science Foundation of China (grant numbers 41672286 and 51408511), Science & Technology Department of Sichuan Province (grant number 2017JQ0042), the Japanese Government (MEXT) Scholarship Program, and the China Scholarship Council (CSC). Additionally, this work was partly supported by the co-research project conducted by Kyushu University and W-NEXCO. The financial supports are gratefully acknowledged. We also appreciate the editor and anonymous reviewers for their useful suggestions that greatly improved the manuscript.
Publisher Copyright:
© 2018 Elsevier Ltd
PY - 2019/2
Y1 - 2019/2
N2 - The computing efficiency of three-dimensional discontinuous deformation analysis (3D-DDA) needs to be improved for large-scale simulations. Among all the subroutines of 3D-DDA, the equation solver is very time-consuming. To accelerate the equation-solving process, this paper proposes implementing the parallel block Jacobi (BJ) and preconditioned conjugate gradient (PCG) iterative solvers into the original 3D-DDA based on OpenMP. The calculation accuracy and computational efficiency are studied by several numerical examples, demonstrating that the modified 3D-DDA with parallel BJ or PCG solver exhibits much higher execution efficiency with satisfactory correctness. The maximum speedup ratio is up to 5.1 for the cases studied.
AB - The computing efficiency of three-dimensional discontinuous deformation analysis (3D-DDA) needs to be improved for large-scale simulations. Among all the subroutines of 3D-DDA, the equation solver is very time-consuming. To accelerate the equation-solving process, this paper proposes implementing the parallel block Jacobi (BJ) and preconditioned conjugate gradient (PCG) iterative solvers into the original 3D-DDA based on OpenMP. The calculation accuracy and computational efficiency are studied by several numerical examples, demonstrating that the modified 3D-DDA with parallel BJ or PCG solver exhibits much higher execution efficiency with satisfactory correctness. The maximum speedup ratio is up to 5.1 for the cases studied.
UR - http://www.scopus.com/inward/record.url?scp=85056829839&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85056829839&partnerID=8YFLogxK
U2 - 10.1016/j.compgeo.2018.11.016
DO - 10.1016/j.compgeo.2018.11.016
M3 - Article
AN - SCOPUS:85056829839
VL - 106
SP - 304
EP - 313
JO - Computers and Geotechnics
JF - Computers and Geotechnics
SN - 0266-352X
ER -