|
Parallel computing and application of Element-Free Galerkin method for GPU acceleration |
Received:September 03, 2014 Revised:November 08, 2014 |
View Full Text View/Add Comment Download reader |
DOI:10.7511/jslx201506006 |
KeyWord:Element-Free Galerkin method GPU acceleration parallel computing CUDA |
Author | Institution |
龚曙光 |
湘潭大学 机械工程学院, 湘潭 |
刘奇良 |
湘潭大学 机械工程学院, 湘潭 |
卢海山 |
湘潭大学 机械工程学院, 湘潭 |
周志勇 |
湘潭大学 机械工程学院, 湘潭 |
张佳 |
湘潭大学 机械工程学院, 湘潭 |
|
Hits: 2553 |
Download times: 1379 |
Abstract: |
In order to reduce the computing time of Element-Free Galerkin(EFG) method,a GPU accele-ration parallel algorithm of EFG method that essential boundary condition is imposed by penalty function method is proposed,in which stiffness matrix is assembled by node pair-wise approach,and sparse linear equations based on CSR format is solved by conjugate gradient methods.The unified format of stiffness matrix and penalty stiffness matrix was derived,and the flow chart of the parallel algorithm was provided.The GPU codes were programmed on CUDA,and algorithm testing was finished on the device of NVIDIA GeForce GTX 660 by numerical examples.The factors of affecting speedup ratio were discussed.The example results verified the feasibility of the proposed algorithm.The maximum speedup ratio was up to 17 times on the premise that the calculating accuracy is met,and to solve linear equations is the major factor in the speedup. |
|
|
|