Code Monkey home page Code Monkey logo

camwa's Introduction

libParanumal

An experimental set of finite element flow solvers for heterogeneous (GPU/CPU) systems. The initial development of libParanumal was performed by the Parallel Numerical Algorithms Group at Virginia Tech.

libParanumal is funded in part by the US Department of Energy as part of the activities of the Center for Efficient Exscale Discretizations.

Why is it called libParanumal?: the high-order finite-element implementations in libParanumal are spectrally accurate and rely heavily on ghost elements for MPI communications.

If you use libParanumal as part of a research project see the references section below for papers to reference.


1. Overview

Brief summary of major features:

A. Supported elements:

  • Triangles, quadrilaterals, tetrahedra, hexahedra.
  • Lagrange basis functions.

B. Mesh wrangling:

  • Gmsh format file loaders.
  • Load balanced geometric partitioning using space filling curves (Hilbert or Morton ordering).

C. Time integrators:

  • Adaptive rate Dormand-Prince order 5 Runge-Kutta.
  • Low storage explicit Runge-Kutta order 4.
  • Single and Multirate Adams-Bashforth order 3.
  • Extrapolated Backwards Differencing order 3.

D. Iterative linear solvers:

  • Preconditioned (flexible) Conjugate Gradient method.
  • Non-blocking Preconditioned (flexible) Conjugate Gradient method.

E. Elliptic solver:

  • Linear Poisson and screened Poisson potential solvers.
  • GPU-optimized matrix-vector products.
  • p-type multigrid, algebraic multigrid, low-order SEMFEM, and Jacobi preconditioning.
  • Matrix-free p-multigrid for fine levels of multigrid hierarchy.

F. Heterogeneous accelerated flow solvers:

  • Compressible Navier-Stokes solver with:
    • Upwind discontinuous Galerkin discretization in space.
    • Optional isothermal equation of state.
  • Galerkin-Boltzmann gas dynamics solver with:
    • Penalty flux DG discretization in space.
    • Adaptive semi-analytic (pointwise exponential) integration in time.
    • Multiaxial quasi-perfectly matched absorbing layer far field boundary condition.
  • Incompressible Navier-Stokes solver with:
    • Choice of continuous FEM or interior penalty DG in space.
    • Extrapolation-BDF integration in time.
    • Sub-cycling (Operator Integration Factor Splitting) for advection.

G. Dependencies:

  • Message Passing Interface (MPI v3.0 or higher).
    • The libParanumal makefiles assume that mpic++ is installed and visible in your path.
  • Open Concurrent Compute Abstraction (OCCA)
    • OCCA must be installed.
    • OCCA will try to detect if any of these execution models are installed: OpenMP, CUDA, OpenCL, and/or HIP.
    • By default, if OCCA does not detect a chosen mode of execution it will default to Serial execution.
    • You will need to adjust the libParnumal setup input files to choose the execution model and compute device appropriate for your system.
    • The OCCA github repo is here
    • The OCCA webpage is here

2. Code block diagram


3. OCCA dependency

git clone https://github.com/libocca/occa

3-1. Build OCCA

cd occa
export OCCA_DIR=${PWD}
export LD_LIBRARY_PATH=$LD_LIBRARY_PATH:$OCCA_DIR/lib
make -j `nproc`
cd ../


4. Clone: libParanumal

git clone https://github.com/paranumal/libparanumal

4-1. Build all libParanumal solvers

cd libparanumal
make -j `nproc`


5. Running the codes:

Each solver resides in its respective sub-directory in solvers/. Each solver sub-directory includes makefile, src directory, data directory (including header files for defining boundary conditions), okl kernel directory, and setups directory. The setups directory includes a number of example input files that specify input parameters for the solver.

5-1. Build libParanumal elliptic solver

cd libparanumal/solvers/elliptic
make -j

5-2. Run elliptic example with provided quadrilateral set up file on a single device:

./ellipticMain setups/setupQuad2D.rc

5-3. Run the same example with four devices:

mpiexec -n 4 ./ellipticMain setups/setupQuad2D.rc


6. License

The MIT License (MIT)

Copyright (c) 2017-2020 Tim Warburton, Noel Chalmers, Jesse Chan, Ali Karakus

Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:

The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.

THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.

7. References

Discontinuous Galerkin Boltzmann (bns) solver: publisher, arXiv version: Karakus, A., Chalmers, N., Hesthaven, J.S. and Warburton, T., 2018. Discontinuous Galerkin Discretizations of the Boltzmann Equations in 2D: semi-analytic time stepping and absorbing boundary layers, Journal of Computational Physics, Volume 390, Pages 175โ€“202.

Incompressible Navier-Stokes (discontinuous) Galerkin (ins) solver: publisher, arXiv version: Karakus, A., Chalmers, N., Swirydowicz, K. and Warburton, T., 2017.A GPU accelerated discontinuous Galerkin incompressible flow solver, Journal of Computational Physics, Volume 390, Pages 380โ€“404, 2019.

Optimization of elliptic mat-vec operations for (elliptic) solver on hexes: publisher, arXiv version: Swirydowicz, K., Chalmers, N., Karakus, A., and Warburton, T. 2019. Acceleration of tensor-product operations for high-order finite element methods, The International Journal of High Performance Computing Applications, Vol 33, Issue 4.

Low-order preconditioning of triangular elements (elliptic precon): publisher: Chalmers, N. and Warburton, T. 2018. Low-order preconditioning of high-order triangular finite elements, SIAM Journal on Scientific Computing, Vol 40, Issue 6, Pages A4040-A4059

camwa's People

Contributors

aaustin141 avatar alikarakus avatar jlchan avatar kswirydo avatar liweichen6 avatar noelchalmers avatar tcew avatar

Watchers

 avatar

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    ๐Ÿ–– Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. ๐Ÿ“Š๐Ÿ“ˆ๐ŸŽ‰

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google โค๏ธ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.