IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-540-26657-0_14.html
   My bibliography  Save this book chapter

parpp3d++ - A Parallel HPC Code for the Incompressible Nonstationary Navier-Stokes Equations

In: High Performance Computing in Science and Engineering, Munich 2004

Author

Listed:
  • Sven H.M. Buijssen

    (University of Dortmund, Institute for Applied Mathematics and Numerics)

  • Stefan Turek

    (University of Dortmund, Institute for Applied Mathematics and Numerics)

Abstract

Parallel multigrid methods belong to the most prominent tools for solving huge systems of (non-)linear equations arising from the discretisation of PDEs, as for instance in Computational Fluid Dynamics (CFD). However, the quality of (parallel) multigrid methods in regard of numerical and computational complexity mainly stands and falls with the smoothing algorithms (“smoother”) used. Since the inherent highly recursive character of many global smoothers (SOR, ILU) often impedes a direct parallelisation, the application of block smoothers is an alternative. However, due to the weakened recursive character, the resulting parallel efficiency may decrease in comparison to the sequential performance, due to a weaker total numerical efficiency. Within this paper, we show the consequences of such a strategy for the resulting total efficiency on the Hitachi SR8000-F1 if incorporated into the parallel CFD solver parpp3d++ for 3D incompressible flow. Moreover, we analyse the numerical losses of parallel efficiency due to communication costs and numerical efficiency on several modern parallel computer platforms.

Suggested Citation

  • Sven H.M. Buijssen & Stefan Turek, 2005. "parpp3d++ - A Parallel HPC Code for the Incompressible Nonstationary Navier-Stokes Equations," Springer Books, in: Siegfried Wagner & Werner Hanke & Arndt Bode & Franz Durst (ed.), High Performance Computing in Science and Engineering, Munich 2004, pages 169-177, Springer.
    • Handle: RePEc:spr:sprchp:978-3-540-26657-0_14
    DOI: 10.1007/3-540-26657-7_14
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-3-540-26657-0_14. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.