Junqing Lin

Junqing Lin

Auto-generated profile, based on publicly available information

Junqing Lin

University of Science and Technology of China, Hefei, China

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

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

Representative Publications

View All Publications
19 November 2024 in ACM Transactions on Architecture and Code Optimization
Verified
Journal Article
Open access
JLJunqing Lin
Junqing Lin
JSJingwei Sun
Jingwei Sun
XSXiaolong Shi
Xiaolong Shi
HZHonghe Zhang
Honghe Zhang
XYXianzhi Yu
Xianzhi Yu
GSGuangzhong Sun
Guangzhong Sun
As deep neural networks (DNNs) become increasingly large and complicated, pruning techniques are proposed for lower memory footprint and more efficient inference. The most critical kernel to execute pruned sparse DNNs on GPUs is Sparse-dense Matrix Multiplication (SpMM). To maximize the performance of SpMM, despite the high-performance implementation generated from advanced tensor compilers, they often take a long time to iteratively search tuning configurations. Such a long time slows down the cycle of exploring better DNN architectures or pruning algorithms. In this article, we propose LO-SpMM to efficiently generate high-performance SpMM implementations for sparse DNN inference. Based on the analysis of nonzero elements’ layout, the characterization of the GPU architecture, and a rank-based cost model, LO-SpMM can effectively reduce the search space and eliminate possibly low-performance candidates. Besides, rather than generating complete SpMM implementations for evaluation, LO-SpMM constructs simplified proxies to quickly estimate performance, thereby substantially reducing compilation and execution costs. Experimental results show that LO-SpMM can reduce the search time by 281× at most, while the performance of generated SpMM implementations is comparable to or better than the state-of-the-art sparse tensor compiling solutions.

7 August 2023
Verified
Conference Paper
Open access
JLJunqing Lin
Junqing Lin
HZHonghe Zhang
Honghe Zhang
XSXiaolong Shi
Xiaolong Shi
JSJingwei Sun
Jingwei Sun
XYXianzhi Yu
Xianzhi Yu
GSGuangzhong Sun
Guangzhong Sun
As deep neural networks (DNNs) become increasingly large and complicated, pruning techniques are proposed for lower memory footprint and more efficient inference. The most critical kernel to execute pruned sparse DNNs on GPUs is Sparse-dense Matrix Multiplication (SpMM). To maximize the performance of SpMM, despite the high-performance code generated from recent tensor compilers, they often take a long time for iteratively searching candidate configurations. Such a long time slows down the cycle of exploring better DNN architectures or pruning algorithms. In this paper, we propose EC-SpMM to efficiently generate high-performance SpMM kernels for sparse DNN inference. Based on the analysis of nonzero elements’ layout, the characterization of GPU architecture, and a rank-based cost model, EC-SpMM can effectively reduce the search space and eliminate possibly low-performance candidates. Experimental results show that EC-SpMM can reduce the compilation time by a factor of 35 ×, while the performance of generated SpMM kernels is comparable or even better, compared with the state-of-the-art sparse tensor compiling solution.

17 July 2026 in ACM Transactions on Architecture and Code Optimization
Verified
Journal Article
Open access
JLJunqing Lin
Junqing Lin
JSJingwei Sun
Jingwei Sun
MLMingge Lu
Mingge Lu
GSGuangzhong Sun
Guangzhong Sun
Sparse Matrix-Vector Multiplication (SpMV) has become a critical performance bottleneck in the local deployment of sparse Large Language Models (LLMs), where inference predominantly operates on workloads during the decoder phase with a batch size of one. Existing SpMV kernels and sparse matrix formats, originally designed for scientific computing, fail to exploit the unique structure patterns inherent in sparse LLMs, resulting in suboptimal performance and excessive storage overhead. This paper presents EC-SpMV, a GPU-optimized SpMV approach for accelerating sparse LLM inference. EC-SpMV introduces (1) a hierarchical block extraction algorithm that captures multiple granularities of block structures within sparse LLMs, and (2) a novel compressed sparse format (EC-CSR) that employs delta indexing to reduce storage overhead and enhance memory access efficiency. Evaluated on sparse weight matrices from LLaMA and OPT models across sparsity levels from 30% to 90%, EC-SpMV achieves up to 7.47 × speedup over state-of-the-art SpMV libraries and reduces storage overhead by up to 58.5% compared to CSR.

27 September 2026
Verified
Conference Paper
Open access
ALAiying Li
Aiying Li
JSJingwei Sun
Jingwei Sun
HLHan Li
Han Li
WJWence Ji
Wence Ji
JLJunqing Lin
Junqing Lin
GSGuangzhong Sun
Guangzhong Sun

26 July 2026
Verified
Conference Paper
Open access
HLHan Li
Han Li
JSJingwei Sun
Jingwei Sun
JLJunqing Lin
Junqing Lin
GSGuangzhong Sun
Guangzhong Sun