Parallel algorithm for explicit finite element analysis based on efficient parallel computational strategy

doi:10.11772/j.issn.1001-9081.2017092384

Journal of Computer Applications ›› 2018, Vol. 38 ›› Issue (4): 1072-1077.DOI: 10.11772/j.issn.1001-9081.2017092384

Previous Articles Next Articles

Parallel algorithm for explicit finite element analysis based on efficient parallel computational strategy

FU Chaojiang^1,2, WANG Tianqi¹, LIN Yuerong¹

1. College of Civil Engineering, Fujian University of Technology, Fuzhou Fujian 350180, China;
2. Fujian Provincial Key Laboratory of Advanced Technology and Informatization in Civil Engineering, Fuzhou Fujian 350180, China

Received:2017-10-09 Revised:2017-12-17 Online:2018-04-09 Published:2018-04-10
Supported by:
This work is partially supported by the National Natural Science Foundation of Chian (51378124).

基于有效并行求解策略的显式有限元分析并行算法

付朝江^1,2, 王天奇¹, 林悦荣¹

1. 福建工程学院土木工程学院, 福州 350108;
2. 福建省土木工程新技术与信息化重点实验室, 福州 350108

通讯作者: 付朝江
作者简介:付朝江(1966-),男,江西九江人,教授,博士,主要研究方向:并行计算、数值分析;王天奇(1994-),男,江苏南京人,硕士研究生,主要研究方向:数值分析;林悦荣(1991-),男,江西赣州人,硕士研究生,主要研究方向:数值分析。
基金资助:
国家自然科学基金资助项目（51378124）。

Abstract

Abstract: Concerning the time-consuming problem of finite element analysis for solving the nonlinear dynamic problems of large-scale structure, some parallel computational strategies for implementing explicit nonlinear finite element analysis were proposed under the environment of Message Passing Interface (MPI) cluster. Based on the technique of domain decomposition with explicit message passing, using overlapped, non-overlapped domain decomposition techniques and Dynamic Task Allocation (DTA) algorithm, domain decomposition parallel algorithms for overlapped domain, non-overlapped domain, clustering for DTA, DTA and Dynamic Load Balancing (DLB) were researched by overlapping calculations and communications to improve the performance of communication between processors. A parallel finite element analysis program was developed with message passing interface as software development environment. Some numerical examples were implemented on workstation cluster to evaluate the performance of the parallel algorithm, the computation performance was also compared with the conventional Newmark algorithm. The experimental results show that the performance of the algorithm for dynamic task allocation with clustering technique is better than that of the dynamic task allocation, which is lower than that of the domain decomposition algorithm, and the dynamic load balancing algorithm is the best. For the problem with the same size, the proposed algorithms are faster and better than conventional Newmark algorithm. The proposed algorithms are efficient for parallel computing of nonlinear dynamic problems of structure.

Key words: parallel computational strategy, domain decomposition, dynamic load balancing, parallel algorithm, finite element analysis

摘要： 针对大规模结构非线性动力问题的有限元分析非常耗时，基于消息传递接口（MPI）机群环境，提出多种基于并行求解策略的显式有限元并行算法。基于显式消息传递的区域分解技术，采取重叠、非重叠区域分解技术及动态任务分配方法，通过将计算与通信重叠，优化处理器间的通信，对非重叠通信区域分解并行算法、重叠通信区域分解并行算法、群动态任务分配算法、动态任务分配算法及动态负载平衡算法进行研究。为在机群环境下实现非线性动力有限元分析，开发了基于有效并行求解策略的显式有限元并行算法。编写了基于消息传递编程模式的并行有限元程序，在工作站机群上实现了数值算例，分析了算法的性能，并与传统的Newmark算法进行了比较。算例表明：群动态任务分配算法的性能优于动态任务分配算法，低于区域分解算法的性能，动态负载平衡算法最优。对相同规模的问题提出的算法比Newmark算法快，优于Newmark算法。对结构非线性动力问题的有限元分析，所提出的并行算法是可行有效的。

关键词: 并行计算策略, 区域分解, 动态负载平衡, 并行算法, 有限元分析

CLC Number:

TP311.1

FU Chaojiang, WANG Tianqi, LIN Yuerong. Parallel algorithm for explicit finite element analysis based on efficient parallel computational strategy[J]. Journal of Computer Applications, 2018, 38(4): 1072-1077.

付朝江, 王天奇, 林悦荣. 基于有效并行求解策略的显式有限元分析并行算法[J]. 计算机应用, 2018, 38(4): 1072-1077.

References

[1] WALSHAW C, CROSS M. Parallel optimisation algorithms for multilevel mesh partitioning[J]. Parallel Computing, 2000, 26(12):1635-1660.
[2] DEVINE K, FLAHERTY J. Parallel adaptive hp-refinement techniques for conservation laws[J]. Applied Numerical Mathematics, 1996, 20(4):367-386.
[3] ZHAO B, LIU Y, GOH S H. Parallel finite element analysis of seismic soil structure interaction using a PC cluster[J]. Computers and Geotechnics, 2016, 80:167-177.
[4] HOU Y R, DU G Z. An expandable local and parallel two-grid finite element scheme[J]. Computers and Mathematics with Applications, 2016, 71(12):2541-2556.
[5] CYBENKO G. Dynamic load balancing for distributed memory multiprocessors[J]. Journal of Parallel and Distributed Computing, 1989, 7(2):279-301.
[6] PATZÁK B, RYPL D. Object-oriented, parallel finite element framework with dynamic load balancing[J]. Advances in Engineering Software, 2012, 47(1):35-50.
[7] BOILLAT J E. Load balancing and Poisson equation in a graph[J]. Concurrency and Computation:Practice and Experience, 1990, 2(4):289-313.
[8] DIEKMANN R, FROMMER A, MONIEN B. Efficient schemes for nearest neighbor load balancing[J]. Parallel Computing, 1999, 25(7):789-812.
[9] SZIVERI J, TOPPING BHV. Transient dynamic nonlinear analysis using MIMD computer architectures[J]. Journal of Computing in Civil Engineering, 2000, 14(2):79-91.
[10] HU Y F, BLAKE R J. An improved diffusion algorithm for dynamic load balancing[J]. Parallel Computing, 1999, 25(4):417-444.
[11] TOUHEED N, SELWOOD P, JIMACK P K. A comparison of some dynamic load-balancing algorithms for a parallel adaptive flow solver[J]. Parallel Computing, 2000, 26(12):1535-1554.
[12] KRYSL P, BITTNAR Z. Parallel explicit finite element solid dynamics with domain decomposition and message passing:dual partitioning scalability[J]. Computers and Structures, 2001, 79(3):345-360.
[13] RAO A R M. Explicit nonlinear dynamic finite element analysis on homogeneous/heterogeneous parallel computing environment[J]. Advances in Engineering Software, 2006, 37(11):701-720.
[14] RAO A R M, RAO T, DATTAGURU B. Generating optimised partitions for parallel finite element computations employing float-encoded genetic algorithms[J]. Computer Modeling in Engineering and Sciences, 2004, 5(3):213-234.
[15] KWAK J Y, CHUN T Y, SHIN S J, et al. Domain decomposition approach to flexible multibody dynamics simulation[J]. Computational Mechanics, 2014, 53(1):147-158.
[16] 付朝江. 集群MPI环境下有限元结构分析并行计算研究[D]. 上海:上海大学, 2006.(FU C J. The research on parallel computation of finite element structural analysis based on MPI cluster[D]. Shanghai:Shanghai University, 2006.)
[17] CAPODAGLIO G, AULISA E. A particle tracking algorithm for parallel finite element applications[J]. Computers and Fluids, 2017, 159:338-355.
[18] 付朝江. 隐式非线性动力分析有限元并行求解格式[J]. 工程力学, 2010, 27(10):27-33.(FU C J. Parallel algorithm for implicit nonlinear dynamic finite element analysis[J]. Engineering Mechanics, 2010, 27(10):27-33.)

Parallel algorithm for explicit finite element analysis based on efficient parallel computational strategy

基于有效并行求解策略的显式有限元分析并行算法

PDF

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 15

Recommended Articles

Metrics

[1]	Zhenyu LIU, Chaokun WANG, Gaoyang GUO. Parallel algorithm of betweenness centrality for dynamic networks [J]. Journal of Computer Applications, 2023, 43(7): 1987-1993.
[2]	CHEN Yuzhong, GUO Songrong, CHEN Hong, LI Wanhua, GUO Kun, HUANG Qicheng. Electricity customers arrears alert based on parallel classification algorithm [J]. Journal of Computer Applications, 2016, 36(6): 1757-1761.
[3]	CHU Zheng, YU Jiong, LU Liang, YING Changtian, BIAN Chen, WANG Yuefei. Parallel access strategy for big data objects based on RAMCloud [J]. Journal of Computer Applications, 2016, 36(6): 1526-1532.
[4]	CAI Yong, LI Sheng. Graphics processor unit parallel computing in Matlab and its application in topology optimization [J]. Journal of Computer Applications, 2016, 36(3): 628-632.
[5]	WANG Chunbo, DONG Hongbin, YIN Guisheng, LIU Wenjie. Super pixel segmentation algorithm based on Hadoop [J]. Journal of Computer Applications, 2016, 36(11): 2985-2992.
[6]	HE Li, LIU Xiaodong, LI Songyang, ZHANG Qian. Parallel particle swarm optimization algorithm in multicore computing environment [J]. Journal of Computer Applications, 2015, 35(9): 2482-2485.
[7]	FU Chaojiang, CHEN Hongjun. Finite element parallel computing based on minimal residual-preconditioned conjugate gradient method [J]. Journal of Computer Applications, 2015, 35(12): 3387-3391.
[8]	LI Shuang LI Wenjing SHUN Huanlong LIN Zhongming. Artificial fish swarm parallel algorithm based on multi-core cluster [J]. Journal of Computer Applications, 2013, 33(12): 3380-3384.
[9]	CHEN Weitao CHEN Dongfan HAN Xingqian ZHOU Chen GAO Xiang. Finite element simulation of implant surgery for vocal cord paralysis [J]. Journal of Computer Applications, 2013, 33(03): 896-900.
[10]	KE Qi ZHONG Cheng CHEN Qingyuan LU Xiangyan. Communication-efficient parallel sorting integers sequence on multi-core cluster [J]. Journal of Computer Applications, 2013, 33(03): 821-824.
[11]	. Application of domain decomposition method in parallel computing of CoLM [J]. Journal of Computer Applications, 2012, 32(11): 2994-2997.
[12]	TUO Qing SONG Yao-hu. Bit-split parallel algorithm for quick sorting based on Java [J]. Journal of Computer Applications, 2012, 32(09): 2455-2457.
[13]	WANG Hai-feng. Parallel algorithms for complex network clustering with GPUs [J]. Journal of Computer Applications, 2012, 32(09): 2458-2462.
[14]	SHAN Guang LING Ling HU Yu-jin. Application of memory-mapped file to extract modal data from results of finite element analysis [J]. Journal of Computer Applications, 2012, 32(05): 1429-1431.
[15]	YUAN Hui-ping. QR factorization and algorithm for generalized row (column) symmetric matrix [J]. Journal of Computer Applications, 2012, 32(04): 990-993.