MPI-CUDA parallelization of a finite-strip program for geometric nonlinear analysis: A hybrid approach

Authors:
P. S. Rakić;D. D. Milašinović;. ivanov;Z. Suvajdin;M. Nikolić;M. Hajduković
Affiliations:
University of Novi Sad, Faculty of Technical Sciences, Novi Sad, Serbia;University of Novi Sad, Faculty of Civil Engineering, Subotica, Serbia;University of Novi Sad, Faculty of Technical Sciences, Novi Sad, Serbia;University of Novi Sad, Faculty of Technical Sciences, Novi Sad, Serbia;University of Novi Sad, Faculty of Technical Sciences, Novi Sad, Serbia;University of Novi Sad, Faculty of Technical Sciences, Novi Sad, Serbia
Venue:
Advances in Engineering Software
Year:
2011

Citing 6
Cited 1

Learning from the Success of MPI

HiPC '01 Proceedings of the 8th International Conference on High Performance Computing
Using graphics processors for high-performance IR query processing

Proceedings of the 17th international conference on World Wide Web
Algorithmic performance studies on graphics processing units

Journal of Parallel and Distributed Computing
A performance study of general-purpose applications on graphics processors using CUDA

Journal of Parallel and Distributed Computing
Accelerator Architectures

IEEE Micro
Parallel Computing Experiences with CUDA

IEEE Micro

Large displacement stability analysis of thin plate structures: Scope of MPI/OpenMP parallelization in harmonic coupled finite strip analysis

Advances in Engineering Software

Quantified Score

Hi-index	0.00

Visualization

Abstract

A finite-strip geometric nonlinear analysis is presented for elastic problems involving folded-plate structures. Compared with the standard finite-element method, its main advantages are in data preparation, program complexity, and execution time. The finite-strip method, which satisfies the von Karman plate equations in the nonlinear elastic range, leads to the coupling of all harmonics. However, coupling of series terms dramatically increases computation time in existing finite-strip sequential programs when a large number of series terms is used. The research reported in this paper combines various parallelization techniques and architectures (computing clusters and graphic processing units) with suitable programming models (MPI and CUDA) to speed up lengthy computations. In addition, a metric expressing the computational weight of input sets is presented. This metric allows computational complexity comparison of different inputs.