Zekun Jiang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Zekun Jiang has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Bo Yuan
College of Computer Science and Technology, National University of Defense Technology, Changsha, Hunan, China
5 shared publications - Sheng Liu
College of Computer Science and Technology, National University of Defense Technology, Changsha, Hunan, China
5 shared publications - Jianfeng Cui
College of Computer Science and Technology, National University of Defense Technology, Changsha, Hunan, China
4 shared publications - Kai Lu
College of Computer Science and Technology, National University of Defense Technology, Changsha, China
4 shared publications - Jianfeng Cui
National University of Defense Technology, Changsha, Hunan, China
1 shared publication - Yang Guo
National University of Defense Technology
1 shared publication
Latest Publications
- Open Access
- 27 September 2026
- Published by Association for Computing Machinery (ACM)
- p. 975-985
RODIS: Accelerating Sparse Matrix Multiplication on GPU via Row-Orchestration and Dynamic Instruction Scheduling
- 27 September 2026
- Published by Association for Computing Machinery (ACM)
- p. 975-985
Open AccessRODIS: Accelerating Sparse Matrix Multiplication on GPU via Row-Orchestration and Dynamic Instruction Scheduling
- Open Access
- 26 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-7
CODA: COoperative register Distribution and Arbitration among Partitioned GPU Sub-Cores
- 26 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-7
Open AccessCODA: COoperative register Distribution and Arbitration among Partitioned GPU Sub-Cores
- Open Access
- 20 July 2026
- Published by Association for Computing Machinery (ACM) in ACM SIGMETRICS Performance Evaluation Review
- Vol. 54 (1) , 129-131
RELL-STC: An Efficient SpMM Extension of Sparse Tensor Core with Re-structured ELLPACK and Gustavson Dataflow
Sparsity is crucial for deep neural networks, reducing storage and bandwidth while improving computational efficiency. With the rapid development of deep neural networks, sparse computation accelerators have become a key research focus. NVIDIA introduced 2:4 fine-grained structured sparsity in the Ampere architecture, doubling Tensor Core peak throughput by retaining two out of four elements, but this may compromise model accuracy. In contrast, unstructured sparsity achieves maximum sparsity without accuracy loss. However, the irregular distribution of non-zero elements (NNZs) in unstructured sparse matrices causes complex memory access and load imbalance, preventing direct use of GPU Tensor Cores. Thus, computation relies on CUDA cores via sparse libraries like cuSPARSE, underutilizing Tensor Cores' capabilities. To address this, we extend the Tensor Core architecture based on Gustavson's dataflow and propose a re-structured row offline compression format for inference. This format integrates with the extended architecture to enable efficient unstructured sparse-dense matrix multiplication. Experiments show negligible area and power overheads, with an average speedup of 3.54x over cuSPARSE and 1.2x over state-of-the-art Tensor Core extensions.
- 20 July 2026
- Published by Association for Computing Machinery (ACM) in ACM SIGMETRICS Performance Evaluation Review
- Vol. 54 (1) , 129-131
Open AccessRELL-STC: An Efficient SpMM Extension of Sparse Tensor Core with Re-structured ELLPACK and Gustavson Dataflow
Sparsity is crucial for deep neural networks, reducing storage and bandwidth while improving computational efficiency. With the rapid development of deep neural networks, sparse computation accelerators have become a key research focus. NVIDIA introduced 2:4 fine-grained structured sparsity in the Ampere architecture, doubling Tensor Core peak throughput by retaining two out of four elements, but this may compromise model accuracy. In contrast, unstructured sparsity achieves maximum sparsity without accuracy loss. However, the irregular distribution of non-zero elements (NNZs) in unstructured sparse matrices causes complex memory access and load imbalance, preventing direct use of GPU Tensor Cores. Thus, computation relies on CUDA cores via sparse libraries like cuSPARSE, underutilizing Tensor Cores' capabilities. To address this, we extend the Tensor Core architecture based on Gustavson's dataflow and propose a re-structured row offline compression format for inference. This format integrates with the extended architecture to enable efficient unstructured sparse-dense matrix multiplication. Experiments show negligible area and power overheads, with an average speedup of 3.54x over cuSPARSE and 1.2x over state-of-the-art Tensor Core extensions.
- Open Access
- 8 June 2026
- Published by Association for Computing Machinery (ACM)
- p. 129-131
RELL-STC: An Efficient SpMM Extension of Sparse Tensor Core with Re-structured ELLPACK and Gustavson Dataflow
- 8 June 2026
- Published by Association for Computing Machinery (ACM)
- p. 129-131
Open AccessRELL-STC: An Efficient SpMM Extension of Sparse Tensor Core with Re-structured ELLPACK and Gustavson Dataflow
- Open Access
- 29 May 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Measurement and Analysis of Computing Systems
- Vol. 10 (2) , 1-22
RELL-STC: An Efficient SpMM Extension of Sparse Tensor Core with Re-structured ELLPACK and Gustavson Dataflow
Sparsity is a crucial optimization technique for deep neural networks, significantly reducing storage and bandwidth requirements while enhancing computational efficiency. In recent years, driven by the rapid advancement of deep neural networks, accelerators targeting sparse computation have emerged as a significant area of research. NVIDIA introduced 2:4 fine-grained structured sparsity starting with the Ampere architecture, which doubles the peak throughput of Tensor Cores by retaining only two out of every four elements. However, the constraints imposed by structured sparsity on parameters may compromise model accuracy. In contrast, unstructured sparsity enables maximum sparsity while maintaining model accuracy. Nevertheless, the irregular distribution of non-zero elements (NNZs) in unstructured sparse matrices introduces complex memory access patterns and load imbalances, preventing the direct utilization of GPU Tensor Cores. Consequently, computation typically relies on CUDA cores via sparse libraries such as cuSPARSE, leaving the powerful computational capabilities of Tensor Cores underutilized. To address this limitation, we extend the Tensor Core architecture inspired by Gustavson's dataflow and propose a re-structured row offline compression format tailored for the inference stage. This format integrates seamlessly with the extended architecture to achieve highly efficient unstructured sparse-dense matrix multiplication. Experimental results demonstrate that with negligible area and power overheads, our method achieves an average speedup of 3.54x compared to cuSPARSE and 1.2x compared to state-of-the-art Tensor Core extensions.
- 29 May 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Measurement and Analysis of Computing Systems
- Vol. 10 (2) , 1-22
Open AccessRELL-STC: An Efficient SpMM Extension of Sparse Tensor Core with Re-structured ELLPACK and Gustavson Dataflow
Sparsity is a crucial optimization technique for deep neural networks, significantly reducing storage and bandwidth requirements while enhancing computational efficiency. In recent years, driven by the rapid advancement of deep neural networks, accelerators targeting sparse computation have emerged as a significant area of research. NVIDIA introduced 2:4 fine-grained structured sparsity starting with the Ampere architecture, which doubles the peak throughput of Tensor Cores by retaining only two out of every four elements. However, the constraints imposed by structured sparsity on parameters may compromise model accuracy. In contrast, unstructured sparsity enables maximum sparsity while maintaining model accuracy. Nevertheless, the irregular distribution of non-zero elements (NNZs) in unstructured sparse matrices introduces complex memory access patterns and load imbalances, preventing the direct utilization of GPU Tensor Cores. Consequently, computation typically relies on CUDA cores via sparse libraries such as cuSPARSE, leaving the powerful computational capabilities of Tensor Cores underutilized. To address this limitation, we extend the Tensor Core architecture inspired by Gustavson's dataflow and propose a re-structured row offline compression format tailored for the inference stage. This format integrates seamlessly with the extended architecture to achieve highly efficient unstructured sparse-dense matrix multiplication. Experimental results demonstrate that with negligible area and power overheads, our method achieves an average speedup of 3.54x compared to cuSPARSE and 1.2x compared to state-of-the-art Tensor Core extensions.