Yue Ding
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Yue Ding has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Chuanfu Xu
National University of Defense Technology
4 shared publications - Haozhong Qiu
National University of Defense Technology College of Computer Science and Technology
4 shared publications - Jian Zhang
China Aerodynamics Research and Development Center
4 shared publications - Jianbin Fang
College of Computer Science and Technology, National University of Defense Technology, Changsha, China
4 shared publications - Liang Deng
China Aerodynamics Research and Development Center
4 shared publications - Yonggang Che
National University of Defense Technology
4 shared publications
Latest Publications
- Open Access
- 25 June 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Architecture and Code Optimization
- Vol. 23 (2) , 1-26
Towards Efficient Symmetric Sparse Matrix-Vector Multiplication on Multi-Cores
Exploiting matrix symmetry to halve memory footprint offers a substantial opportunity for accelerating memory-bound computations like Sparse Matrix-Vector Multiplication (SpMV). However, symmetric SpMV incurs data conflicts when concurrently writing the output vector. Previous approaches fail to address this issue efficiently, i.e., either are non-scalable or yield poor performance for large high-bandwidth irregular matrices. This article extends DCS-SpMV , a D ivide-and- C onquer (DC) based shared-memory implementation of S ymmetric SpMV. The key idea of DCS-SpMV is to recursively divide and reorder the matrix-induced conflict graph into independent subgraphs for parallel execution, and construct separate subgraphs to avoid data conflicts. The DC approach naturally transforms the input matrix into a low-conflict part and a high-conflict part, which motivates us to design a conflict-aware hybrid solution DCH-SpMV that executes these two parts using DCS-SpMV and the standard SpMV, respectively. We also develop a machine learning model for DCH-SpMV to predict the optimal number of DC recursions on a given matrix and architecture. In this work, we further optimize the hybrid DC implementation by reducing data conflicts before the DC preprocessing. First, we present a conflict-pruning strategy to decouple certain highly dense columns or rows from the conflict graph of a symmetric matrix. Second, we implement a heuristic to adaptively select the lower or upper triangular part of a symmetric matrix, leading to fewer data conflicts. Our optimizations not only facilitate the DC preprocessing, but also improve the performance of DCH-SpMV. We evaluate our work on both x86 and ARM multi-core CPUs using 298 symmetric sparse matrices from the SuiteSparse Matrix Collection. Our new optimizations improve the performance of previous version [ 42 ] by up to 4.89×, demonstrating significant speedup over the state-of-the-art approaches including the vendor-tuned Intel oneMKL library.
- 25 June 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Architecture and Code Optimization
- Vol. 23 (2) , 1-26
Open AccessTowards Efficient Symmetric Sparse Matrix-Vector Multiplication on Multi-Cores
Exploiting matrix symmetry to halve memory footprint offers a substantial opportunity for accelerating memory-bound computations like Sparse Matrix-Vector Multiplication (SpMV). However, symmetric SpMV incurs data conflicts when concurrently writing the output vector. Previous approaches fail to address this issue efficiently, i.e., either are non-scalable or yield poor performance for large high-bandwidth irregular matrices. This article extends DCS-SpMV , a D ivide-and- C onquer (DC) based shared-memory implementation of S ymmetric SpMV. The key idea of DCS-SpMV is to recursively divide and reorder the matrix-induced conflict graph into independent subgraphs for parallel execution, and construct separate subgraphs to avoid data conflicts. The DC approach naturally transforms the input matrix into a low-conflict part and a high-conflict part, which motivates us to design a conflict-aware hybrid solution DCH-SpMV that executes these two parts using DCS-SpMV and the standard SpMV, respectively. We also develop a machine learning model for DCH-SpMV to predict the optimal number of DC recursions on a given matrix and architecture. In this work, we further optimize the hybrid DC implementation by reducing data conflicts before the DC preprocessing. First, we present a conflict-pruning strategy to decouple certain highly dense columns or rows from the conflict graph of a symmetric matrix. Second, we implement a heuristic to adaptively select the lower or upper triangular part of a symmetric matrix, leading to fewer data conflicts. Our optimizations not only facilitate the DC preprocessing, but also improve the performance of DCH-SpMV. We evaluate our work on both x86 and ARM multi-core CPUs using 298 symmetric sparse matrices from the SuiteSparse Matrix Collection. Our new optimizations improve the performance of previous version [ 42 ] by up to 4.89×, demonstrating significant speedup over the state-of-the-art approaches including the vendor-tuned Intel oneMKL library.
- 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
Efficient and Scalable Hybrid Parallelization of Unstructured Computational Fluid Dynamics with Geometric Multigrid
Computational Fluid Dynamics (CFD) on unstructured meshes are widely used to simulate complex flow problems. Geometric Multigrid (GMG) is an essential method to accelerate CFD simulations. However, achieving high efficiency and scalability for unstructured geometric multigrid CFD is very challenging, due to data conflicts or data dependencies at shared-memory level as well as communication bottlenecks at distributed-memory level. Traditional hybrid parallelization schemes, which typically employ domain decomposition for MPI at distributed-memory level and mesh coloring for OpenMP at shared-memory level, fail to scale on modern HPC architectures. This article proposes an efficient and scalable hybrid parallelization scheme for unstructured geometric multigrid CFD. To begin with, we extend our previous work, 1 the Task Dependency Tree (TDT) approach [ 33 ], to expose shared-memory parallelism from unstructured mesh computations while respecting both data conflicts and data dependencies. We adapt TDT to handle multiple GMG levels with complex mesh boundaries. TDT can be implemented using a task-based programming model such as OpenMP task , which offers a unique opportunity to fine-grained computation-communication overlap in hybrid parallelization. Therefore, at distributed-memory level we introduce the one-sided asynchronous multithreaded Partitioned Global Address Space (PGAS) model, and develop a PGAS+TDT hybrid scheme. We propose an adaptive scheduling strategy to maximize the overlap of communication and computation tasks in our hybrid scheme. Our work was implemented and evaluated in a production-level unstructured CFD software on both x86 and ARM multi-core architectures. On a single compute node, TDT dramatically outperforms the prior shared-memory approaches, delivering a speedup of up to 5.2×. For large-scale tests, our PGAS+TDT hybrid scheme enhances performance by up to 2.0× over the engineer-tuned MPI-only version, with a strong scalability of about 70% when scaling to 128 compute nodes.
- 22 March 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Architecture and Code Optimization
- Vol. 23 (1) , 1-24
Open AccessEfficient and Scalable Hybrid Parallelization of Unstructured Computational Fluid Dynamics with Geometric Multigrid
Computational Fluid Dynamics (CFD) on unstructured meshes are widely used to simulate complex flow problems. Geometric Multigrid (GMG) is an essential method to accelerate CFD simulations. However, achieving high efficiency and scalability for unstructured geometric multigrid CFD is very challenging, due to data conflicts or data dependencies at shared-memory level as well as communication bottlenecks at distributed-memory level. Traditional hybrid parallelization schemes, which typically employ domain decomposition for MPI at distributed-memory level and mesh coloring for OpenMP at shared-memory level, fail to scale on modern HPC architectures. This article proposes an efficient and scalable hybrid parallelization scheme for unstructured geometric multigrid CFD. To begin with, we extend our previous work, 1 the Task Dependency Tree (TDT) approach [ 33 ], to expose shared-memory parallelism from unstructured mesh computations while respecting both data conflicts and data dependencies. We adapt TDT to handle multiple GMG levels with complex mesh boundaries. TDT can be implemented using a task-based programming model such as OpenMP task , which offers a unique opportunity to fine-grained computation-communication overlap in hybrid parallelization. Therefore, at distributed-memory level we introduce the one-sided asynchronous multithreaded Partitioned Global Address Space (PGAS) model, and develop a PGAS+TDT hybrid scheme. We propose an adaptive scheduling strategy to maximize the overlap of communication and computation tasks in our hybrid scheme. Our work was implemented and evaluated in a production-level unstructured CFD software on both x86 and ARM multi-core architectures. On a single compute node, TDT dramatically outperforms the prior shared-memory approaches, delivering a speedup of up to 5.2×. For large-scale tests, our PGAS+TDT hybrid scheme enhances performance by up to 2.0× over the engineer-tuned MPI-only version, with a strong scalability of about 70% when scaling to 128 compute nodes.
- Open Access
- 19 September 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Architecture and Code Optimization
- Vol. 22 (3) , 1-25
DCSolver: Accelerating Sparse Iterative Solvers via Divide-and-Conquer on GPUs
Sparse iterative solvers are commonly used in various fields. However, certain essential kernels of these solvers, such as sparse triangular solves (SpTRSV), present significant challenges for efficient parallelization due to data dependencies . Previous methods, like level-scheduling or multi-coloring, typically involve creating a Task Dependency Graph (TDG) to represent data dependencies and identify independent sets from the TDG for parallel execution. However, these approaches often result in limited parallelism with substantial synchronization overheads or negatively impact the solver convergence rate. This article introduces DCSolver , a Divide-and-Conquer (DC) framework designed to efficiently parallelize sparse solvers with data dependencies on GPUs. To achieve this, we break down the solver TDG into independent subgraphs, allowing us to exploit both coarse-grained and fine-grained parallelism. To efficiently allocate GPU threads for subgraphs with varying degrees of parallelism, we have developed an adaptive in-warp scheduling strategy. Additionally, we propose a hybrid parallelization scheme in DCSolver, which involves employing different parallel approaches for different DC recursions to achieve a more optimal balance between parallelism and convergence for solvers. To evaluate the effectiveness of DCSolver, we apply it to two preconditioned Krylov subspace solvers and an unstructured mesh Computational Fluid Dynamics (CFD) solver. Our results show that when compared with the state-of-the-art methods, DCSolver accelerates the time-to-solution of solvers by an average speedup of up to 26.19X.
- 19 September 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Architecture and Code Optimization
- Vol. 22 (3) , 1-25
Open AccessDCSolver: Accelerating Sparse Iterative Solvers via Divide-and-Conquer on GPUs
Sparse iterative solvers are commonly used in various fields. However, certain essential kernels of these solvers, such as sparse triangular solves (SpTRSV), present significant challenges for efficient parallelization due to data dependencies . Previous methods, like level-scheduling or multi-coloring, typically involve creating a Task Dependency Graph (TDG) to represent data dependencies and identify independent sets from the TDG for parallel execution. However, these approaches often result in limited parallelism with substantial synchronization overheads or negatively impact the solver convergence rate. This article introduces DCSolver , a Divide-and-Conquer (DC) framework designed to efficiently parallelize sparse solvers with data dependencies on GPUs. To achieve this, we break down the solver TDG into independent subgraphs, allowing us to exploit both coarse-grained and fine-grained parallelism. To efficiently allocate GPU threads for subgraphs with varying degrees of parallelism, we have developed an adaptive in-warp scheduling strategy. Additionally, we propose a hybrid parallelization scheme in DCSolver, which involves employing different parallel approaches for different DC recursions to achieve a more optimal balance between parallelism and convergence for solvers. To evaluate the effectiveness of DCSolver, we apply it to two preconditioned Krylov subspace solvers and an unstructured mesh Computational Fluid Dynamics (CFD) solver. Our results show that when compared with the state-of-the-art methods, DCSolver accelerates the time-to-solution of solvers by an average speedup of up to 26.19X.
- Open Access
- 20 February 2024
- Published by Association for Computing Machinery (ACM)
- p. 109-119
Towards Scalable Unstructured Mesh Computations on Shared Memory Many-Cores
Due to data conflicts or data dependences, exploiting shared memory parallelism on unstructured mesh applications is highly challenging. The prior approaches are neither general nor scalable on emerging many-core processors. This paper presents a general and scalable shared memory approach for unstructured mesh computations. We recursively divide and reorder an unstructured mesh to construct a task dependency tree (TDT), where massive parallelism is exposed and data conflicts as well as data dependences are respected. We propose two recursion strategies to support popular programming models on both CPUs and GPUs for TDT. We evaluate our approach by applying it to an industrial unstructured Computational Fluid Dynamics (CFD) software. Experimental results show that our approach significantly outperforms the prior shared memory approaches, delivering up to 8.1× performance improvement over the engineer-tuned implementations.
- 20 February 2024
- Published by Association for Computing Machinery (ACM)
- p. 109-119
Open AccessTowards Scalable Unstructured Mesh Computations on Shared Memory Many-Cores
Due to data conflicts or data dependences, exploiting shared memory parallelism on unstructured mesh applications is highly challenging. The prior approaches are neither general nor scalable on emerging many-core processors. This paper presents a general and scalable shared memory approach for unstructured mesh computations. We recursively divide and reorder an unstructured mesh to construct a task dependency tree (TDT), where massive parallelism is exposed and data conflicts as well as data dependences are respected. We propose two recursion strategies to support popular programming models on both CPUs and GPUs for TDT. We evaluate our approach by applying it to an industrial unstructured Computational Fluid Dynamics (CFD) software. Experimental results show that our approach significantly outperforms the prior shared memory approaches, delivering up to 8.1× performance improvement over the engineer-tuned implementations.