YunQuan Zhang

Dr. YunQuan Zhang

Institute of Computing Technology, Chinese Academy of Science, 100190 Beijing, China

Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

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

Representative Publications

View All Publications
1 May 2007 in Frontiers of Computer Science in China
Verified
Journal Article
Closed access
PDF file
YunQuan ZhangYunQuan Zhang
YunQuan Zhang
GCGuoliang Chen
Guoliang Chen
GSGuangzhong Sun
Guangzhong Sun
QMQiankun Miao
Qiankun Miao

20 February 2024
Verified
Conference Paper
Open access
YCYuetao Chen
Yuetao Chen
KLKun Li
Kun Li
YWYuhao Wang
Yuhao Wang
DBDonglin Bai
Donglin Bai
LWLei Wang
Lei Wang
MYMao Yang
Mao Yang
Tensor Core Unit (TCU) is increasingly integrated into modern high-performance processors to enhance matrix multiplication performance. However, constrained to its over-specification, its potential for improving other critical scientific operations like stencil computations remains untapped. This paper presents ConvStencil1, a novel stencil computing system designed to efficiently transform stencil computation to matrix multiplication on Tensor Cores. We first develop a performance model for ConvStencil to guide algorithm design and optimization on TCUs. Based on this model, we propose three techniques: (1) Memory-efficient Layout Transformation using the stencil2row method; (2) Computation-dense Compute Adaptation with Dual Tessellation and kernel fusion; and (3) Performance-boosting Conflict Removal using a Lookup Table and Dirty Bits Padding. ConvStencil outperforms other stencil optimization frameworks, achieving significant speedups compared to solutions like AMOS, cuDNN, Brick, DRStencil, and TCStencil. By transforming stencil computation on Tensor Cores, ConvStencil promises to improve the performance of various scientific and engineering applications.

13 March 2020 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Open access
ZLZhihao Li
Zhihao Li
HJHaipeng Jia
Haipeng Jia
YunQuan ZhangYunQuan Zhang
YunQuan Zhang
TCTun Chen
Tun Chen
LYLiang Yuan
Liang Yuan
RVRichard Vuduc
Richard Vuduc
This paper presents AutoFFT, a template-based code generation framework that can automatically generate high-performance FFT kernels for all natural-number radices. AutoFFT is based on the Cooley-Tukey FFT algorithm, which exploits the symmetric and periodic properties of the DFT matrix, as the outer parallelization framework. Because butterflies are the core operations of the Cooley-Tukey algorithm, we explore additional symmetric and periodic properties of the DFT matrix and formulate multiple optimized calculation templates to further reduce the number of floating-point operations for butterflies of arbitrary natural numbers. To fully exploit hardware resources, we encapsulate a series of optimizations in an assembly template optimizer. Given any DFT problem, AutoFFT automatically generates C FFT kernels using these calculation templates and converts them into efficient assembly kernels using the template optimizer. Through a series of experiments on Arm, Intel, and AMD processors, we show that AutoFFT-generated kernels can outperform those in Fastest Fourier Transform in the West (FFTW), the Arm Performance Libraries (ARMPL), and the Intel Math Kernel Library (MKL).

23 July 2024 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
CWCunyang Wei
Cunyang Wei
HJHaipeng Jia
Haipeng Jia
YunQuan ZhangYunQuan Zhang
YunQuan Zhang
JYJianyu Yao
Jianyu Yao
CLChendi Li
Chendi Li
WCWenxuan Cao
Wenxuan Cao
The matrix multiplication algorithm is a fundamental numerical technique in linear algebra and plays a crucial role in many scientific computing applications. Despite the high performance of mainstream basic linear algebra libraries for large-scale dense matrix multiplications, they exhibit poor performance when applied to matrix multiplication with irregular input. This paper proposes an input-aware tuning framework that accounts for application scenarios and computer architectures to provide high-performance irregular matrix multiplication on ARMv8 and X86 CPUs. The framework comprises two stages: the install-time stage and the run-time stage. The install-time stage utilizes our proposed computational template to generate high-performance kernels for general data layout and SIMD-friendly data layout. The run-time stage utilizes a tiling algorithm suitable for irregular GEMM to select the optimal kernel and link as an execution plan. Additionally, load-balanced multi-threaded optimization algorithms are defined to exploit the multi-threading capability of modern processors. Experiments demonstrate that the proposed IrGEMM framework can achieve significant performance improvements for irregular GEMM on both ARMv8 and X86 CPUs compared to other mainstream BLAS libraries.

28 February 2025
Verified
Conference Paper
Open access
HHHaozhi Han
Haozhi Han
KLKun Li
Kun Li
WCWei Cui
Wei Cui
DBDonglin Bai
Donglin Bai
YZYiwei Zhang
Yiwei Zhang
MYMao Yang
Mao Yang
While Tensor Core Units (TCUs) excel in AI tasks, their application to HPC algorithms like stencil computations faces significant challenges due to sparsity, which leads to underutilization and exacerbates memory-bound limitations. This paper introduces FlashFFTStencil1, a memory-efficient stencil computing system designed to bridge FFT to fully-dense stencil computations on TCUs. Aimed at bound shifting, FlashFFTStencil comprises three key techniques: Kernel Tailoring on HBM fuses distinct kernels to enhance parallelism while reducing memory transfer and footprint; Architecture Aligning on SMEM restructures FFT-based stencil computations into dense matrix multiplications tailored for shared memory architecture; Computation Streamlining on TCU optimizes TCU utilization and thread parallelism by minimizing pipeline stalls and maximizing register reuse. Notably, a distinctive extension is FlashFFTStencil's ability to enable theoretically unrestricted temporal fusion by FFT. Results show that FlashFFTStencil achieves effective sparsity-free bound shifting, with an average speedup of 2.57x over the state-of-the-art. FlashFFTStencil pioneers a new era in unifying computational patterns within the HPC landscape and bridges them with cutting-edge AI-driven hardware innovations like TCUs.

21 December 2022 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
HCHang Cao
Hang Cao
LYLiang Yuan
Liang Yuan
HZHe Zhang
He Zhang
YunQuan ZhangYunQuan Zhang
YunQuan Zhang
BWBaodong Wu
Baodong Wu
JXJunmin Xiao
Junmin Xiao
The atmospheric general circulation model (AGCM) has been an important research tool in the study of climate change for decades. As the demand for high-resolution simulation is becoming urgent, the scalability and simulation efficiency is faced with great challenges, especially for the latitude-longitude mesh-based models. In this paper, we propose a highly scalable 3D atmospheric general circulation model based on leap-format, namely AGCM-3DLF. Firstly, it utilizes a 3D decomposition method allowing for parallelism release in all three physical dimensions. Then the leap-format difference computation scheme is adopted to maintain computational stability in grid updating and avoid additional filtering at the high latitudes. A novel shifting window communication algorithm is designed for parallelization of the unified model. Furthermore, a series of optimizations are conducted to improve the effectiveness of large-scale simulations. Experiment results in different platforms demonstrate good efficiency and scalability of the model. AGCM-3DLF scales up to the entire CAS-Xiandao1 supercomputer (196,608 CPU cores), attaining the speed of 11.1 simulation-year-per-day (SYPD) at a high resolution of 25KM. In addition, simulations conducted on the Sunway TaihuLight supercomputer exhibit a 1.06 million cores scalability with 36.1% parallel efficiency.