wp Ma

Dr. wp Ma

Xinyang Normal University
orcid

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
13 September 2023 in CCF Transactions on High Performance Computing
Verified
Journal Article
Closed access
PDF file
HZHaoyuan Zhang
Haoyuan Zhang
WMwp Ma
wp Ma
WYWu Yuan
Wu Yuan
JZJian Zhang
Jian Zhang
ZLZhonghua Lu
Zhonghua Lu

27 May 2019 in Scientific Programming
Verified
Journal Article
Open access
PDF file
WMwp Ma
wp Ma
WYWu Yuan
Wu Yuan
XHXiaodong Hu
Xiaodong Hu
In this paper, we develop and parallelize a CFD solver that supports overlapped meshes on multiple MIC architectures by using multithreaded technique. We optimize the solver through several considerations including vectorization, memory arrangement, and an asynchronous strategy for data exchange on multiple devices. Comparisons of different vectorization strategies are made, and the performances of core functions of the solver are reported. Experiments show that about 3.16x speedup can be achieved for the six core functions on a single Intel Xeon Phi 5110P MIC card, and 5.9x speedup can be achieved using two cards compared to an Intel E5-2680 processor for two ONERA M6 wings case.

27 February 2021 in Mathematical Problems in Engineering
Verified
Journal Article
Open access
PDF file
WMwp Ma
wp Ma
YHYiwen Hu
Yiwen Hu
WYWu Yuan
Wu Yuan
XLXiazhen Liu
Xiazhen Liu
Solving triangular systems is the building block for preconditioned GMRES algorithm. Inexact preconditioning becomes attractive because of the feature of high parallelism on accelerators. In this paper, we propose and implement an iterative, inexact block triangular solve on multi-GPUs based on PETSc’s framework. In addition, by developing a distributed block sparse matrix-vector multiplication procedure and investigating the optimized vector operations, we form the multi-GPU-enabled preconditioned GMRES with the block Jacobi preconditioner. In the implementation, the GPU-Direct technique is employed to avoid host-device memory copies. The preconditioning step used by PETSc’s structure and the cuSPARSE library are also investigated for performance comparisons. The experiments show that the developed GMRES with inexact preconditioning on 8 GPUs can achieve up to 4.4x speedup over the CPU-only implementation with exact preconditioning using 8 MPI processes.

16 July 2017 in Scientific Programming
Verified
Journal Article
Open access
PDF file
WMwp Ma
wp Ma
ZLZhonghua Lu
Zhonghua Lu
WYWu Yuan
Wu Yuan
XHXiaodong Hu
Xiaodong Hu
This paper presents a parallel, GPU-based, deforming mesh-enabled unsteady numerical solver for solving moving body problems by using OpenACC. Both the 2D and 3D parallel algorithms based on spring-like deforming mesh methods are proposed and then implemented through OpenACC programming model. Furthermore, these algorithms are coupled with an unstructured mesh based, implicit time scheme integrated numerical solver, which makes the full GPU version of the solver capable of handling unsteady calculations with deforming mesh. Experiments results show that the proposed parallel deforming mesh algorithm can achieve over 2.5x speedup on K20 GPU card in comparison with 20 OpenMP threads on Intel E5-2658 V2 CPU cores. And both 2D and 3D cases are conducted to validate the efficiency, correctness, and accuracy of the present solver.

10 December 2025 in Scientific Reports
Verified
Journal Article
Open access
WMwp Ma
wp Ma
SZSiyuan Zhao
Siyuan Zhao
XLXiaofan Le
Xiaofan Le
WYWu Yuan
Wu Yuan
Modern engineering and scientific computing often requires solving sparse linear systems containing point-block matrix to model multiphysics problems. The space-time parallel method is popular and attractive in fluid dynamics, fitting parallel computers very well. In this paper, we design and implement a parallel, multi-GPU enabled GMRES solver for solving linear systems in the Kronecker product form arising from the domain decomposition based space-time parallel methods. To improve the efficiency of the solver, we also design a set of optimization strategies for Sparse Matrix-Vector Multiplication (SpMV) in Kronecker product form. These include: (1) enhancing the Compute-to-Memory Access Ratio (CMAR) to fully utilize the high bandwidth nature of the GPU during the computation phase and (2) introducing a parallel buffering scheme and a pre-mapping algorithm to enable the use of GPU-Direct for accelerating the communication phase. We conducted experiments on 1, 2, 4, and 8 GPUs and compared the performance of OKP-Solver with the cuSPARSE based implementation. On the V100 platform, the Kronecker product based SpMV computation ([Formula: see text]) achieves speedups of [Formula: see text], [Formula: see text], [Formula: see text], and [Formula: see text] on 1, 2, 4, and 8 GPUs, respectively, while the communication time ([Formula: see text]) achieves [Formula: see text], [Formula: see text], and [Formula: see text] on 2, 4, and 8 GPUs, respectively. On the A100 platform, [Formula: see text] achieves speedups of [Formula: see text], [Formula: see text], [Formula: see text], and [Formula: see text], while [Formula: see text] achieves [Formula: see text], [Formula: see text], and [Formula: see text]. The overall solver runtime ([Formula: see text]) achieves speedups of [Formula: see text], [Formula: see text], [Formula: see text], and [Formula: see text] on V100, and [Formula: see text], [Formula: see text], [Formula: see text], and [Formula: see text] on A100, for 1, 2, 4, and 8 GPUs, respectively.

25 May 2021 in Mathematical Problems in Engineering
Verified
Journal Article
Open access
PDF file
WMwp Ma
wp Ma
YHYiwen Hu
Yiwen Hu
WYWu Yuan
Wu Yuan
XLXiazhen Liu
Xiazhen Liu
Solving sparse triangular systems is the building block for incomplete LU- (ILU-) based preconditioning, but parallel algorithms, such as the level-scheduling scheme, are sometimes limited by available parallelism extracted from the sparsity pattern. In this study, the block version of the incomplete sparse approximate inverses (ISAI) algorithm is studied, and the block-ISAI is considered for preconditioning by proposing an efficient algorithm and implementation on graphical processing unit (GPU) accelerators. Performance comparisons are carried out between the proposed algorithm and serial and parallel block triangular solvers from PETSc and cuSPARSE libraries. The experimental results show that GMRES (30) with the proposed block-ISAI preconditioning achieves accelerations 1.4 × –6.9 × speedups over that using the cuSPARSE library on NVIDIA Tesla V100 GPU.