Abstract
This paper presents an efficient strategy for the matrix assembly procedure in a Galerkin implementation of local maximum-entropy (LME) meshfree schemes, using graphic processor units (GPUs) as massive parallel accelerators. LME basis functions show excellent performance in the simulation of vibrational and acoustic problems, described by the Helmholtz equation. However, even considering a locally truncated support, their evaluation requires a significantly higher number of neighbors, as compared to finite elements and other meshfree methods, which poses several challenges towards a computationally efficient allocation and filling of the required sparse matrices structures. The proposed algorithm relies on a clustering strategy, and it is structured to exploit the massive parallelism of GPU architectures. Numerical examples demonstrate that this strategy enables a substantial performance boost, deriving from a synergic effect of the relatively higher computational throughput and typically larger memory bandwidth of GPUs, as compared to conventional CPUs. For the more demanding stage, we report speedups up to 1035× when using a Titan X GPU hosted in a dedicated workstation, and a more modest yet substantial acceleration up to 91× when using a mobile workstation, finally opening up to the possibility of handling industrially relevant applications not only on dedicated high-performance computing infrastructures but also on commodity hardware.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Computer Methods in Applied Mechanics and Engineering
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.