Parallel Computation of Unsteady Incompressible Viscous Flows Using an Unstructured Multigrid Method

2002 ◽  
Author(s):  
Yong Zhao ◽  
Chin Hoe Tai
Keyword(s):  
Unsteady Flow ◽  
Message Passing ◽  
Message Passing Interface ◽  
Multigrid Method ◽  
Numerical Solutions ◽  
Viscous Flows ◽  
Finite Volume Scheme ◽  
Decomposition Approach ◽  
Incompressible Viscous Flows ◽  
Multigrid Solvers

The development and validation of a parallel unstructured non-nested multigrid method for simulation of unsteady incompressible viscous flow is presented. The Navier-Stokes solver is based on the artificial compressibility method (ACM) [10] and a higher-order characteristics-based finite-volume scheme [8] on unstructured multigrids. Unsteady flow is calculated with an implicit dual time stepping scheme. The parallelization of the solver is achieved by a multigrid domain decomposition approach (MG-DD), using the Single Program Multiple Data (SPMD) programming paradigm and Message-Passing Interface (MPI) for communication of data. The parallel codes using single grids and multigrids are used to simulate steady and unsteady incompressible viscous flows over a circular cylinder for validation and performance evaluation purposes. Speedups and parallel efficiencies obtained by both the parallel single-grid and multigrid solvers are reasonably good for both test cases, using up to 32 processors on the SGI Origin 2000. A maximum speedup of 12 could be achieved on 16 processors for the unsteady flow. The parallel results obtained agree well with those of serial solvers and with numerical solutions obtained by other researchers, as well as experimental measurements.

Evaluation of a Parallel Agglomeration Multigrid Finite-Volume Algorithm, Named Galatea-I, for the Simulation of Incompressible Flows on 3D Hybrid Unstructured Grids

2014 ◽  
Author(s):  
Sotirios S. Sarakinos ◽  
Georgios N. Lygidakis ◽  
Ioannis K. Nikolos
Keyword(s):  
Finite Volume ◽  
Message Passing ◽  
Data Exchange ◽  
Message Passing Interface ◽  
Incompressible Flows ◽  
Navier Stokes ◽  
Finite Volume Scheme ◽  
Computational Domain ◽  
Naca0012 Airfoil ◽  
Computational Performance

In this study an academic Computational Fluid Dynamics (CFD) code, named Galatea-I, is described, which employs the Reynolds Averaged Navier–Stokes (RANS) equations along with the artificial compressibility method and the SST (Shear Stress Transport) turbulence model for the prediction of incompressible viscous flows. For the representation of the computational domain unstructured hybrid grids are utilized, composed of tetrahedral, prismatic and pyramidical elements, while for its discretization a node-centered finite-volume scheme is implemented. Galatea-I is enhanced with a parallelization method, which employs spatial domain decomposition, while the data exchange between processors/processes is performed with the use of the Message Passing Interface (MPI) protocol. In addition, a parallel agglomeration multigrid methodology has been incorporated to improve further its computational performance. The proposed code is validated against steady-state flow benchmark test cases, concerning laminar flow over a cubic cavity and a cylindrical surface, as well as turbulent flow over a rectangular wing with a NACA0012 airfoil. The obtained results, compared with these of corresponding reference solvers, reveal Galatea-I’s potential for simulation of inviscid, viscous laminar and turbulent incompressible flows.

CIP and Parallel Computing Based Numerical Solutions of 3-D Slamming Problems

2015 ◽  
Author(s):  
Peng Wen ◽  
Wei Qiu
Keyword(s):  
Parallel Computing ◽  
Message Passing ◽  
Message Passing Interface ◽  
Numerical Solutions ◽  
Three Dimensional ◽  
Simulation Method ◽  
Water Entry ◽  
Computational Domain ◽  
Cip Method ◽  
Constrained Interpolation

This paper presents the further development of numerical simulation method to solve 3-D highly non-linear slamming problems using parallel computing algorithms. The water entry problems are treated as multi-phase problems (solid, water and air) and governed by the Navier-Stokes (N-S) equations. They are solved by the three-dimensional constrained interpolation profile (CIP) method. The interfaces between different phases are captured using density functions. In the computation, the 3-D CIP method is employed for the advection phase of the N-S equations and a pressure-based algorithm is applied for the non-advection phase. The bi-conjugate gradient stabilized method (BiCGSTAB) is utilized to solve the linear equation systems. A Message Passing Interface (MPI) parallel computing scheme was implemented in the computations. For the parallel computations, the three-dimensional Cartesian decomposition of the computational domain was used. The speed-up performance of various decomposition schemes were studied. Validation studies were carried out for the water entry of a 3-D wedge and a 3-D ship section with prescribed velocities. The computed slamming force, pressure distribution and free-surface elevations are compared with experimental results and numerical results by other methods.

Granular Dynamics Simulation on Multiple GPUs Using Domain Decomposition

2012 ◽  
Author(s):  
Hammad Mazhar ◽  
Andrew Seidl ◽  
Rebecca Shotwell ◽  
Marco B. Quadrelli ◽  
Dan Negrut ◽  
...  
Keyword(s):  
Domain Decomposition ◽  
Message Passing ◽  
Message Passing Interface ◽  
Dynamics Simulation ◽  
Software Infrastructure ◽  
Decomposition Approach ◽  
Multiple Gpus ◽  
Granular Dynamics ◽  
Spatial Subdivision ◽  
Multi Body

This paper describes the software infrastructure needed to enable massive multi-body simulation using multiple GPUs. Utilizing a domain decomposition approach, a large system made up of billions of bodies can be split into self-contained subdomains which are then transferred to different GPUs and solved in parallel. Parallelism is enabled on multiple levels, first on the CPU through OpenMP and secondly on the GPU through NVIDIA CUDA (Compute Unified Device Architecture). This heterogeneous software infrastructure can be extended to networks of computers using MPI (Message Passing Interface) as each subdomain is self-contained. This paper will discuss the implementation of the spatial subdivision algorithm used for subdomain creation along with the algorithms used for collision detection and constraint solution.

Multi-level Parallelization of Genotype Imputation on Supercomputers

2020 ◽  
Vol 15 ◽  
Author(s):  
Weiwen Zhang ◽  
Long Wang ◽  
Theint Theint Aye ◽  
Juniarto Samsudin ◽  
Yongqing Zhu
Keyword(s):  
Association Study ◽  
Message Passing ◽  
High Performance ◽  
Message Passing Interface ◽  
Genome Wide Association Study ◽  
Job Scheduling ◽  
Genotype Imputation ◽  
Job Level ◽  
Multi Level ◽  
High Performance Requirement

Background: Genotype imputation as a service is developed to enable researchers to estimate genotypes on haplotyped data without performing whole genome sequencing. However, genotype imputation is computation intensive and thus it remains a challenge to satisfy the high performance requirement of genome wide association study (GWAS). Objective: In this paper, we propose a high performance computing solution for genotype imputation on supercomputers to enhance its execution performance. Method: We design and implement a multi-level parallelization that includes job level, process level and thread level parallelization, enabled by job scheduling management, message passing interface (MPI) and OpenMP, respectively. It involves job distribution, chunk partition and execution, parallelized iteration for imputation and data concatenation. Due to the design of multi-level parallelization, we can exploit the multi-machine/multi-core architecture to improve the performance of genotype imputation. Results: Experiment results show that our proposed method can outperform the Hadoop-based implementation of genotype imputation. Moreover, we conduct the experiments on supercomputers to evaluate the performance of the proposed method. The evaluation shows that it can significantly shorten the execution time, thus improving the performance for genotype imputation. Conclusion: The proposed multi-level parallelization, when deployed as an imputation as a service, will facilitate bioinformatics researchers in Singapore to conduct genotype imputation and enhance the association study.

scholarly journals Distributed Singular Value Decomposition Method for Fast Data Processing in Recommendation Systems

Energies ◽  
2021 ◽  
Vol 14 (8) ◽  
pp. 2284
Author(s):  
Krzysztof Przystupa ◽  
Mykola Beshley ◽  
Olena Hordiichuk-Bublivska ◽  
Marian Kyryk ◽  
Halyna Beshley ◽  
...  
Keyword(s):  
Distributed Systems ◽  
Singular Value Decomposition ◽  
Data Processing ◽  
Message Passing ◽  
Message Passing Interface ◽  
Recommendation Systems ◽  
Singular Value ◽  
Singular Value Decomposition Method ◽  
Value Decomposition ◽  
Svd Method

The problem of analyzing a big amount of user data to determine their preferences and, based on these data, to provide recommendations on new products is important. Depending on the correctness and timeliness of the recommendations, significant profits or losses can be obtained. The task of analyzing data on users of services of companies is carried out in special recommendation systems. However, with a large number of users, the data for processing become very big, which causes complexity in the work of recommendation systems. For efficient data analysis in commercial systems, the Singular Value Decomposition (SVD) method can perform intelligent analysis of information. With a large amount of processed information we proposed to use distributed systems. This approach allows reducing time of data processing and recommendations to users. For the experimental study, we implemented the distributed SVD method using Message Passing Interface, Hadoop and Spark technologies and obtained the results of reducing the time of data processing when using distributed systems compared to non-distributed ones.

A local adaptive remeshing procedure for unsteady incompressible viscous flows

2020 ◽  
Author(s):  
Etienne Muller ◽  
Yohann Vautrin ◽  
Dominique Pelletier ◽  
Andre Garon
Keyword(s):  
Viscous Flows ◽  
Adaptive Remeshing ◽  
Incompressible Viscous Flows

A high-performance, portable implementation of the MPI message passing interface standard

1996 ◽  
Vol 22 (6) ◽  
pp. 789-828 ◽  
Author(s):  
William Gropp ◽  
Ewing Lusk ◽  
Nathan Doss ◽  
Anthony Skjellum
Keyword(s):  
Message Passing ◽  
High Performance ◽  
Message Passing Interface
Sign in / Sign up

Export Citation Format

Share Document