Performance analysis of the parallel CUPID code for various parallel programming models in symmetric multi-processing system

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

Abstract

A parallelization of the bi-conjugate gradient solver for the pressure equation of the CUPID (component unstructured program for interfacial dynamics) code, which was developed for analyzing the components of a pressurized water-cooled reactor, was studied in a symmetric multi-processing system. The parallel performance was investigated for three typical parallel programming models (MPI, OpenMP, Hybrid) by solving incompressible backward-facing step flow at various grid resolutions. It was confirmed that parallel performance was low when problem size was small or the memory requirement for each thread was considerably higher than the cache memory. Furthermore, it was shown that MPI was better than OpenMP regardless of the problem size, and Hybrid was the best when the number of threads was relatively small.

Original languageEnglish
Pages (from-to)71-79
Number of pages9
JournalTransactions of the Korean Society of Mechanical Engineers, B
Volume38
Issue number1
DOIs
StatePublished - Jan 2014

Keywords

  • Bi-Conjugate Gradient
  • CUPID
  • Parallel Programming Model
  • Symmetric Multi-Processing

Fingerprint

Dive into the research topics of 'Performance analysis of the parallel CUPID code for various parallel programming models in symmetric multi-processing system'. Together they form a unique fingerprint.

Cite this