Hongjie Zhao
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Hongjie Zhao has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Jian Zhang
China Aerodynamics Research and Development Center
1 shared publication - Jie Liu
Laboratory of Digitizing Software for Frontier Equipment, National University of Defense Technology, Changsha, Hunan, China
1 shared publication - Liang Deng
China Aerodynamics Research and Development Center
1 shared publication - Mingfeng Guo
Computational Aerodynamics Institute, China Aerodynamics Research and Development Center
1 shared publication - Qiang Zhang
School of Computer Science, Southwest Petroleum University, China
1 shared publication - Ruitian Li
Computational Aerodynamics Institute, China Aerodynamics Research and Development Center
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 June 2023
- Published by Association for Computing Machinery (ACM)
- p. 85-91
Parallel Optimization of SLIC Algorithm for New-Generation Sunway Processors
This study aims to explore optimization methods for superpixel segmentation algorithms in large-scale image processing. Due to the significant time consumption of existing superpixel segmentation algorithms when dealing with large-scale image data, this study focuses on parallel optimization of the SLIC superpixel segmentation algorithm on the new-generation Sunway manycore processor SW26010-Pro. The research analyzes the characteristics of the SW26010-Pro heterogeneous manycore processor, existing superpixel image segmentation algorithms, and the SLIC superpixel segmentation algorithm. The study primarily analyzes hot-spot functions and improves the algorithm's running speed by 6-7 times through optimizing processes such as RGB-to-CIELab color space conversion, cluster updating, and seed point updating. It effectively presents a parallel execution scheme for the SLIC superpixel algorithm on the SW26010-Pro.
- 17 June 2023
- Published by Association for Computing Machinery (ACM)
- p. 85-91
Open AccessParallel Optimization of SLIC Algorithm for New-Generation Sunway Processors
This study aims to explore optimization methods for superpixel segmentation algorithms in large-scale image processing. Due to the significant time consumption of existing superpixel segmentation algorithms when dealing with large-scale image data, this study focuses on parallel optimization of the SLIC superpixel segmentation algorithm on the new-generation Sunway manycore processor SW26010-Pro. The research analyzes the characteristics of the SW26010-Pro heterogeneous manycore processor, existing superpixel image segmentation algorithms, and the SLIC superpixel segmentation algorithm. The study primarily analyzes hot-spot functions and improves the algorithm's running speed by 6-7 times through optimizing processes such as RGB-to-CIELab color space conversion, cluster updating, and seed point updating. It effectively presents a parallel execution scheme for the SLIC superpixel algorithm on the SW26010-Pro.