Parallelization of moving particle semi-implicit method

Guangtao Duan, Bin Chen

Research output: Contribution to journalArticlepeer-review

Abstract

The Moving Particle Semi-implicit Method (MPS) has been proven useful in simulation of free-surface flows. One of its main drawbacks is the high computational load. The solution for the Pressure Poisson Equation (PPE) is the critical issue in parallelizing the MPS algorithm because it is the most time-consuming part and the original ICCG solver is difficult to parallelize. The Symmetric Lanczos Algorithm (SLA), which is easy to parallelize and as effective as ICCG, is introduced to solve PPE. After decomposing computational domain into subdomains which are one by one assigned to different nodes of a cluster, the MPI model is used to exchange the information of particles between the adjacent subdomains and the OpenMP model is used to accelerate the simulation in each node. It is shown that MPS can be accelerated by 37.5 times on a cluster with 100 CPU cores by the hybrid OpenMP/MPI model.

Original languageEnglish
Pages (from-to)2077-2080
Number of pages4
JournalKung Cheng Je Wu Li Hsueh Pao/Journal of Engineering Thermophysics
Volume34
Issue number11
Publication statusPublished - 2013 Nov 1
Externally publishedYes

Keywords

  • MPS
  • OpenMP/MPI
  • Pressure poisson equation
  • Symmetric Lanczos algorithm

ASJC Scopus subject areas

  • Materials Science(all)
  • Condensed Matter Physics
  • Mechanical Engineering

Fingerprint Dive into the research topics of 'Parallelization of moving particle semi-implicit method'. Together they form a unique fingerprint.

Cite this