×

GPU acceleration for FEM-based structural analysis. (English) Zbl 1354.65246

Summary: Graphic Processing Units (GPUs) have greatly exceeded their initial role of graphics accelerators and have taken a new role of co-processors for computation – heavy tasks. Both hardware and software ecosystems have now matured, with fully IEEE compliant double precision and memory correction being supported and a rich set of software tools and libraries being available. This in turn has lead to their increased adoption in a growing number of fields, both in academia and, more recently, in industry. In this review we investigate the adoption of GPUs as accelerators in the field of Finite Element Structural Analysis, a design tool that is now essential in many branches of engineering. We survey the work that has been done in accelerating the most time consuming steps of the analysis, indicate the speedup that has been achieved and, where available, highlight software libraries and packages that will enable the reader to take advantage of such acceleration. Overall, we try to draw a high level picture of where the state of the art is currently at.

MSC:

65N30 Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs
65Y10 Numerical algorithms for specific classes of architectures
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Acceleware http://www.acceleware.com/matrix-solvers
[2] Anzt H, Tomov S, Gates M, Dongarra J, Heuveline V (2012) Block-asynchronous multigrid smoothers for GPU-accelerated systems. Proc Comput Sci 9:7-16 · doi:10.1016/j.procs.2012.04.002
[3] BCSLIB-EXT http://www.aanalytics.com/products.htm
[4] Bell, N.; Garland, M., Implementing sparse matrix-vector multiplication on throughput-oriented processors, 1-11 (2009), New York · doi:10.1145/1654059.1654078
[5] Bolz, J.; Farmer, I.; Grinspun, E.; Schrooder, P., Sparse matrix solvers on the GPU: conjugate gradients and multigrid, 917-924 (2003), New York · doi:10.1145/1201775.882364
[6] Botsch, M.; Bommes, D.; Vogel, C.; Kobbelt, L., GPU-based tolerance volumes for mesh processing, 237-243 (2004)
[7] Buatois, L.; Caumon, G.; Lévy, B., Concurrent number cruncher: an efficient sparse linear solver on the GPU, 358-371 (2007) · doi:10.1007/978-3-540-75444-2_37
[8] Cecka C, Lew A, Darve E (2011) Assembly of finite element methods on graphics processors. Int J Numer Methods Eng 85(5):640-669 · Zbl 1217.80146 · doi:10.1002/nme.2989
[9] Cevahir, A.; Nukada, A.; Matsuoka, S., Fast conjugate gradients with multiple GPUs, 893-903 (2009) · doi:10.1007/978-3-642-01970-8_90
[10] Cevahir A, Nukada A, Matsuoka S (2010) High performance conjugate gradient solver on multi-GPU clusters using hypergraph partitioning. Comput Sci Res Dev 25(1):83-91 · doi:10.1007/s00450-010-0112-6
[11] Choi, J.; Singh, A.; Vuduc, R., Model-driven autotuning of sparse matrix-vector multiply on GPUs, 115-126 (2010), New York · doi:10.1145/1693453.1693471
[12] CHOLMOD http://www.cise.ufl.edu/research/sparse/cholmod/
[13] Crivelli, L.; Dunbar, M., Evolving use of GPU for Dassault Systemes simulation products (2012)
[14] CULA Sparse http://www.culatools.com/sparse/
[15] CUSP http://code.google.com/p/cusp-library/ · Zbl 0785.11030
[16] DeCoro, C.; Tatarchuk, N., Real-time mesh simplification using the GPU, 161-166 (2007) · doi:10.1145/1230100.1230128
[17] Dehnavi MM, Fernandez D, Gaudiot JL, Giannacopoulos D (2012) Parallel sparse approximate inverse preconditioning on graphic processing units. IEEE Trans Parallel Distrib Syst 99:1 · doi:10.1109/TPDS.2012.286
[18] Filipovic, J.; Peterlik, I.; Fousek, J., GPU acceleration of equations assembly in finite elements method—preliminary results (2009)
[19] George, T.; Saxena, V.; Gupta, A.; Singh, A.; Choudhury, A., Multifrontal factorization of sparse SPD matrices on GPUs, 372-383 (2011)
[20] Georgescu S, Chow P (2011) GPU accelerated CAE using open solvers and the cloud. Comput Archit News 39(4):14-19 · doi:10.1145/2082156.2082161
[21] Georgescu S, Okuda H (2010) Conjugate gradients on multiple GPUs. Int J Numer Methods Fluids 64:1254-1273 · Zbl 1206.65131 · doi:10.1002/fld.2462
[22] Geveler, M.; Ribbrock, D.; Göddeke, D.; Zajac, P.; Turek, S., Efficient finite element geometric multigrid solvers for unstructured grids on GPUs (2011) · Zbl 1284.76249 · doi:10.4203/ccp.95.22
[23] Göddeke, D.; Strzodka, R.; Turek, S.; Hülsemann, F. (ed.); Kowarschik, M. (ed.); Rüde, UA (ed.), Accelerating double precision FEM simulations with GPUs, 139-144 (2005), San Diego
[24] Göddeke D, Strzodka R, Turek SA (2007) Performance and accuracy of hardware-oriented native-, emulated- and mixed-precision solvers in FEM simulations. Int J Parallel Emerg Dist Syst 22(4):221-256 · Zbl 1188.68084 · doi:10.1080/17445760601122076
[25] Göddeke D, Strzodka RA (2008) Performance and accuracy of hardware-oriented native-, emulated- and mixed-precision solvers in FEM simulations (part 2: double precision GPUs). Tech rep, Fakultät für Mathematik, TU Dortmund (2008). Ergebnisberichte des Instituts für Angewandte Mathematik, nummer 370 · Zbl 1188.68084
[26] Göhner U (2012) Usage of GPU in LS-DYNA. LS-DYNA forum
[27] Haase, G.; Liebmann, M.; Douglas, C.; Plank, G., A parallel algebraic multigrid solver on graphics processing units, 38-47 (2010) · doi:10.1007/978-3-642-11842-5_5
[28] Heuveline, V.; Lukarski, D.; Trost, N.; Weiss, JP; Keller, R. (ed.); Kramer, D. (ed.); Weiss, JP (ed.), Parallel smoothers for matrix-based geometric multigrid methods on locally refined meshes using multicore CPUs and GPUs, 158-171 (2012), Berlin · doi:10.1007/978-3-642-30397-5_14
[29] Hjelmervik, J.; Léon, J., GPU-accelerated shape simplification for mechanical-based applications, 91-102 (2007), New York
[30] Kamiabad A (2011) Implementing a preconditioned iterative linear solver using massively parallel graphics processing units. Master’s thesis, University of Toronto
[31] Kraus, J.; Foster, M.; Keller, R. (ed.); Kramer, D. (ed.); Weiss, JP (ed.), Efficient AMG on heterogeneous systems, No. 7174, 133-146 (2012), Berlin · doi:10.1007/978-3-642-30397-5_12
[32] Krawezik, G.; Poole, G., Accelerating the ANSYS direct sparse solver with GPUs (2009)
[33] Krüger J, Westermann R (2003) Linear algebra operators for GPU implementation of numerical algorithms. ACM Trans Graph 22:908-916 · doi:10.1145/882262.882363
[34] Lacoste X, Ramet P, Faverge M, Ichitaro Y, Dongarra J et al (2012) Sparse direct solvers with accelerators over DAG runtimes. Tech rep 7972, INRIA
[35] LAMA http://www.libama.org · Zbl 1284.76249
[36] LAToolbox from HiFlow http://www.hiflow3.org
[37] Lequiniou, E.; Zhou, H., Speedup Altair RADIOSS solvers using NVIDIA GPU (2012)
[38] Li R, Saad Y (2010) GPU-accelerated preconditioned iterative linear solvers. Tech rep, University of Minnesota
[39] Liao, C., MSC Nastran sparse direct solvers for Tesla GPUs (2012)
[40] Lucas R, Wagenbreth G, Tran J, Davis D (2007) Multifrontal computations on GPUs. Tech rep, Unpublished ISI white paper · Zbl 1323.65136
[41] Luitjens, J.; Williams, A.; Heroux, M., Optimizing miniFE an implicit finite element application on GPUs (2012)
[42] Maciol P, Plaszewski P, Banas K (2010) 3D finite element numerical integration on GPUs. Proc Comput Sci 1(1):1087-1094 · doi:10.1016/j.procs.2010.04.121
[43] MatrixPro-GSS http://www.matrixprosoftware.com/
[44] Minden, V.; Smith, B.; Knepley, M., Preliminary Implementation of PETSc Using GPUs (2010)
[45] MiniFE https://software.sandia.gov/mantevo/download.html
[46] Naumov M (2011) Incomplete-LU and Cholesky preconditioned iterative methods using CUSPARSE and CUBLAS. Technical report and white paper
[47] Neic, A.; Liebmann, M.; Haase, G., Algebraic multigrid solver on clusters of CPUs and GPUs, 389-398 (2012) · doi:10.1007/978-3-642-28145-7_38
[48] NVIDIA (2012) NVIDIA CUDA programming guide 5.0
[49] PASTIX http://pastix.gforge.inria.fr
[50] PETSc http://www.mcs.anl.gov/petsc/
[51] Płaszewski, P.; Macioł, P.; Banaś, K., Finite element numerical integration on GPUs, 411-420 (2010) · doi:10.1007/978-3-642-14390-8_43
[52] Posey, S.; Courteille, F., GPU progress in sparse matrix solvers for applications in computational mechanics (2012)
[53] Qi, M.; Cao, TT; Tan, TS, Computing 2D constrained Delaunay triangulation using the GPU, 39-46 (2012), New York · doi:10.1145/2159616.2159623
[54] Rong, G.; Tan, T.; Cao, T.; etal., Computing two-dimensional Delaunay triangulation using graphics hardware, 89-97 (2008), New York · doi:10.1145/1342250.1342264
[55] Sawyer W, Vanini C, Fourestey G, Popescu R (2012) SPAI preconditioners for HPC applications. PAMM 12(1):651-652 · doi:10.1002/pamm.201210314
[56] Schenk O, Christen M, Burkhart H (2008) Algorithmic performance studies on graphics processing units. J Parallel Distrib Comput 68(10):1360-1369 · doi:10.1016/j.jpdc.2008.05.008
[57] Shontz, SM; Nistor, DM; Jiao, X. (ed.); Weill, JC (ed.), CPU-GPU algorithms for triangular surface mesh simplification, 475-492 (2013), Berlin · doi:10.1007/978-3-642-33573-0_28
[58] The Khronos Group (2011) OpenCL specification 1.2
[59] Verschoor M, Jalba AC (2012) Analysis and performance estimation of the conjugate gradient method on multiple GPUs. Parallel Comput 38:552-575 · doi:10.1016/j.parco.2012.07.002
[60] ViennaCL http://viennacl.sourceforge.net/
[61] Vuduc, R.; Chandramowlishwaran, A.; Choi, J.; Guney, M.; Shringarpure, A., On the limits of GPU acceleration, 13 (2010)
[62] Wagner, M.; Rupp, K.; Weinbub, J., A comparison of algebraic multigrid preconditioners using graphics processing units and multi-core central processing units, 1-8 (2012)
[63] Wang, M.; Klie, H.; Parashar, M.; Sudan, H., Solving sparse linear systems on NVIDIA Tesla GPUs, 864-873 (2009) · doi:10.1007/978-3-642-01970-8_87
[64] Weber D, Bender J, Schnoes M, Stork A, Fellner D (2013) Efficient GPU data structures and methods to solve sparse linear systems in dynamics applications. Comput Graph Forum 32(1):16-26. doi:10.1111/j.1467-8659.2012.03227.x · doi:10.1111/j.1467-8659.2012.03227.x
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.