Mingfeng Guo
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Mingfeng Guo has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Zhe Dai
China Aerodynamics Research and Development Center
2 shared publications - Hongjie Zhao
China Aerodynamics Research and Development Center
1 shared publication Jian Zhang
1 shared publication- Jian Zhang
China Aerodynamics Research and Development Center
1 shared publication Jie Liu
1 shared publication- Jie Liu
Laboratory of Digitizing Software for Frontier Equipment, National University of Defense Technology, Changsha, Hunan, China
1 shared publication
Latest Publications
- Open Access
- 22 March 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Architecture and Code Optimization
- Vol. 23 (1) , 1-24
HiDAP-BILU: Hierarchical Dependency-Aware Parallelism for Block ILU Preconditioner on GPUs
The block incomplete LU (BILU(0)) preconditioner is widely adopted for solving large-scale block-sparse linear systems arising from coupled partial differential equations (PDEs). However, strong inherent data dependencies and high memory bandwidth requirements of block matrix operations in the preconditioner pose significant challenges for efficient implementation on GPUs. Existing methods face the tradeoff between parallelism and convergence, and efforts to leverage the block properties remain limited. In this work, we introduce HiDAP-BILU for dependency-aware BILU(0) preconditioner on GPUs. HiDAP-BILU employs a block-centric hierarchical parallelism strategy to maximize concurrency. A block-to-block waiting scheme is proposed to preserve inter-block dependencies, while warp-level data distribution operations are utilized to maintain intra-block dependencies. Aligned with block-centric hierarchical parallelism, various architecture-aware optimizations are designed to minimize warp divergence and ensure coalesced memory access. Experiment results demonstrate that HiDAP-BILU achieves up to 4.77x and 3.10x speedups compared with state-of-the-art general methods for factorization and triangular solve, respectively. Additionally, it provides an average speedup of 3.11x in end-to-end BILU-preconditioned iterative solvers.
- 22 March 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Architecture and Code Optimization
- Vol. 23 (1) , 1-24
Open AccessHiDAP-BILU: Hierarchical Dependency-Aware Parallelism for Block ILU Preconditioner on GPUs
The block incomplete LU (BILU(0)) preconditioner is widely adopted for solving large-scale block-sparse linear systems arising from coupled partial differential equations (PDEs). However, strong inherent data dependencies and high memory bandwidth requirements of block matrix operations in the preconditioner pose significant challenges for efficient implementation on GPUs. Existing methods face the tradeoff between parallelism and convergence, and efforts to leverage the block properties remain limited. In this work, we introduce HiDAP-BILU for dependency-aware BILU(0) preconditioner on GPUs. HiDAP-BILU employs a block-centric hierarchical parallelism strategy to maximize concurrency. A block-to-block waiting scheme is proposed to preserve inter-block dependencies, while warp-level data distribution operations are utilized to maintain intra-block dependencies. Aligned with block-centric hierarchical parallelism, various architecture-aware optimizations are designed to minimize warp divergence and ensure coalesced memory access. Experiment results demonstrate that HiDAP-BILU achieves up to 4.77x and 3.10x speedups compared with state-of-the-art general methods for factorization and triangular solve, respectively. Additionally, it provides an average speedup of 3.11x in end-to-end BILU-preconditioned iterative solvers.
- Open Access
- 17 February 2026
- Published by Elsevier in SSRN Electronic Journal
Parallel implicit methods for an Unstructured CFD Simulator on GPU
The advancement of GPU technology has revolutionized Computational Fluid Dynamics (CFD) by enabling efficient generation of high-precision flow field data. However, a critical challenge lies in reconciling the fast convergence of data-dependent implicit schemes with GPU parallelism, as existing methods struggle to strike a balance between computational efficiency and convergence accuracy. This study systematically evaluates four implicit approaches implemented in the industrial solver FlowStar, focusing on efficiency-convergence trade-offs stemming from serial dependencies that limit GPU utilization. To address these limitations, a balanced coloring and hyperplane method is proposed to optimize hardware resource allocation, while a unified evaluation framework quantifies performance across five unstructured grid configurations. Experimental results demonstrate that the balanced coloring and hyperplane implementations achieve comprehensive speedups of 2.33× and 1.15× against the conventional level-set parallelization. This work provides actionable insights for designing parallel CFD algorithms that harmonize parallelism with numerical stability.
- 17 February 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessParallel implicit methods for an Unstructured CFD Simulator on GPU
The advancement of GPU technology has revolutionized Computational Fluid Dynamics (CFD) by enabling efficient generation of high-precision flow field data. However, a critical challenge lies in reconciling the fast convergence of data-dependent implicit schemes with GPU parallelism, as existing methods struggle to strike a balance between computational efficiency and convergence accuracy. This study systematically evaluates four implicit approaches implemented in the industrial solver FlowStar, focusing on efficiency-convergence trade-offs stemming from serial dependencies that limit GPU utilization. To address these limitations, a balanced coloring and hyperplane method is proposed to optimize hardware resource allocation, while a unified evaluation framework quantifies performance across five unstructured grid configurations. Experimental results demonstrate that the balanced coloring and hyperplane implementations achieve comprehensive speedups of 2.33× and 1.15× against the conventional level-set parallelization. This work provides actionable insights for designing parallel CFD algorithms that harmonize parallelism with numerical stability.