View in EDS PDF Full Text

Incompressible fluid simulation algorithm optimization of OpenFOAM on Tianhe supercomputing.

Saved in:
Bibliographic Details
Title: Incompressible fluid simulation algorithm optimization of OpenFOAM on Tianhe supercomputing.
Authors: LIU, Zhongmin1 1539409961@qq.com, ZHANG, Xiang2 zhangxiang08@nudt.edu.cn, MA, Di2 madi@nudt.edu.cn, SUN, Yang3 victor_sun@nudt.edu, ZHOU, Lei1, QIU, Qi1, GONG, Chunye2,4
Source: Computer Engineering & Science / Jisuanji Gongcheng yu Kexue. Dec2025, Vol. 47 Issue 12, p2119-2128. 10p.
Subjects: Incompressible flow, Computational fluid dynamics, Parallel processing, Supercomputers, Gauss-Seidel method, Optimization algorithms, ARM microprocessors, Iterative methods (Mathematics)
Abstract: The incompressible fluid simulation solvers in the open-source fluid dynamics software OpenFOAM exhibit cross-platform applicability. However, their performance optimizations are predominantly tailored to supercomputing systems with existing architectures such as Intel, rendering their algorithmic optimizations unable to fully leverage the vectorized parallel advantages of the ARM architecture on the Tianhe supercomputing system. To address this, this paper focuses on incompressible fluid simulation solvers as the research subject and employs ARM vectorization techniques to optimize their symmetric Gauss-Seidel (SGS) method and diagonal incomplete Cholesky preconditioned conjugate gradient (DIC-PCG) method, thereby enhancing the solver's operational efficiency. To achieve vectorization goals, this paper analyzes the relationships between neighboring grid cells during a single iteration of the two types of solving algorithms, revealing that the maximum number of neighboring cells is two and that there are no dependencies between them. Leveraging this prior knowledge, the original algorithm code is modified with minimal cost--specifically, by adding just four lines of if-else conditional statements--to vectorize the neighboring cells and accelerate the algorithms. Experimental results under various configurations demonstrate that the improved algorithm achieves a maximum single-core speedup of 1.75 and a maximum multi-core speedup of 149.16, with a parallel efficiency still reaching 29.13%. [ABSTRACT FROM AUTHOR]
Copyright of Computer Engineering & Science / Jisuanji Gongcheng yu Kexue is the property of Computer Engineering & Science and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
FullText Links:
  – Type: pdflink
Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 190735170
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Incompressible fluid simulation algorithm optimization of OpenFOAM on Tianhe supercomputing.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22LIU%2C+Zhongmin%22">LIU, Zhongmin</searchLink><relatesTo>1</relatesTo><i> 1539409961@qq.com</i><br /><searchLink fieldCode="AR" term="%22ZHANG%2C+Xiang%22">ZHANG, Xiang</searchLink><relatesTo>2</relatesTo><i> zhangxiang08@nudt.edu.cn</i><br /><searchLink fieldCode="AR" term="%22MA%2C+Di%22">MA, Di</searchLink><relatesTo>2</relatesTo><i> madi@nudt.edu.cn</i><br /><searchLink fieldCode="AR" term="%22SUN%2C+Yang%22">SUN, Yang</searchLink><relatesTo>3</relatesTo><i> victor_sun@nudt.edu</i><br /><searchLink fieldCode="AR" term="%22ZHOU%2C+Lei%22">ZHOU, Lei</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22QIU%2C+Qi%22">QIU, Qi</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22GONG%2C+Chunye%22">GONG, Chunye</searchLink><relatesTo>2,4</relatesTo>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Computer+Engineering+%26+Science+%2F+Jisuanji+Gongcheng+yu+Kexue%22">Computer Engineering & Science / Jisuanji Gongcheng yu Kexue</searchLink>. Dec2025, Vol. 47 Issue 12, p2119-2128. 10p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Incompressible+flow%22">Incompressible flow</searchLink><br /><searchLink fieldCode="DE" term="%22Computational+fluid+dynamics%22">Computational fluid dynamics</searchLink><br /><searchLink fieldCode="DE" term="%22Parallel+processing%22">Parallel processing</searchLink><br /><searchLink fieldCode="DE" term="%22Supercomputers%22">Supercomputers</searchLink><br /><searchLink fieldCode="DE" term="%22Gauss-Seidel+method%22">Gauss-Seidel method</searchLink><br /><searchLink fieldCode="DE" term="%22Optimization+algorithms%22">Optimization algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22ARM+microprocessors%22">ARM microprocessors</searchLink><br /><searchLink fieldCode="DE" term="%22Iterative+methods+%28Mathematics%29%22">Iterative methods (Mathematics)</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: The incompressible fluid simulation solvers in the open-source fluid dynamics software OpenFOAM exhibit cross-platform applicability. However, their performance optimizations are predominantly tailored to supercomputing systems with existing architectures such as Intel, rendering their algorithmic optimizations unable to fully leverage the vectorized parallel advantages of the ARM architecture on the Tianhe supercomputing system. To address this, this paper focuses on incompressible fluid simulation solvers as the research subject and employs ARM vectorization techniques to optimize their symmetric Gauss-Seidel (SGS) method and diagonal incomplete Cholesky preconditioned conjugate gradient (DIC-PCG) method, thereby enhancing the solver's operational efficiency. To achieve vectorization goals, this paper analyzes the relationships between neighboring grid cells during a single iteration of the two types of solving algorithms, revealing that the maximum number of neighboring cells is two and that there are no dependencies between them. Leveraging this prior knowledge, the original algorithm code is modified with minimal cost--specifically, by adding just four lines of if-else conditional statements--to vectorize the neighboring cells and accelerate the algorithms. Experimental results under various configurations demonstrate that the improved algorithm achieves a maximum single-core speedup of 1.75 and a maximum multi-core speedup of 149.16, with a parallel efficiency still reaching 29.13%. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Computer Engineering & Science / Jisuanji Gongcheng yu Kexue is the property of Computer Engineering & Science and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=190735170
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.3969/j.issn.1007-130X.2025.12.004
    Languages:
      – Code: chi
        Text: Chinese
    PhysicalDescription:
      Pagination:
        PageCount: 10
        StartPage: 2119
    Subjects:
      – SubjectFull: Incompressible flow
        Type: general
      – SubjectFull: Computational fluid dynamics
        Type: general
      – SubjectFull: Parallel processing
        Type: general
      – SubjectFull: Supercomputers
        Type: general
      – SubjectFull: Gauss-Seidel method
        Type: general
      – SubjectFull: Optimization algorithms
        Type: general
      – SubjectFull: ARM microprocessors
        Type: general
      – SubjectFull: Iterative methods (Mathematics)
        Type: general
    Titles:
      – TitleFull: Incompressible fluid simulation algorithm optimization of OpenFOAM on Tianhe supercomputing.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: LIU, Zhongmin
      – PersonEntity:
          Name:
            NameFull: ZHANG, Xiang
      – PersonEntity:
          Name:
            NameFull: MA, Di
      – PersonEntity:
          Name:
            NameFull: SUN, Yang
      – PersonEntity:
          Name:
            NameFull: ZHOU, Lei
      – PersonEntity:
          Name:
            NameFull: QIU, Qi
      – PersonEntity:
          Name:
            NameFull: GONG, Chunye
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 12
              Text: Dec2025
              Type: published
              Y: 2025
          Identifiers:
            – Type: issn-print
              Value: 1007130X
          Numbering:
            – Type: volume
              Value: 47
            – Type: issue
              Value: 12
          Titles:
            – TitleFull: Computer Engineering & Science / Jisuanji Gongcheng yu Kexue
              Type: main
ResultId 1