Xiaojian Yang

Xiaojian Yang

Auto-generated profile, based on publicly available information

Xiaojian Yang

National University of Defense Technology

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
21 June 2023
Verified
Conference Paper
Open access
XYXiaojian Yang
Xiaojian Yang
SLShengguo Li
Shengguo Li
FYFan Yuan
Fan Yuan
DDDezun Dong
Dezun Dong
CHChun Huang
Chun Huang
Zheng WangZheng Wang
Zheng Wang
Multigrid algorithms are widely used to solve large-scale sparse linear systems, which is essential for many high-performance workloads. The symmetric Gauss-Seidel (SYMGS) method is often responsible for the performance bottleneck of MG. This paper presents new methods to parallelize and enhance the computation and parallelization efficiency of the SYMGS and MG algorithms on multi-core CPUs. Our solution employs a matrix splitting strategy and a revised computation formula to decrease the computation operations and memory accesses in SYMGS. With this new SYMGS strategy, we can then merge the two most time-consuming components of MG. On top of these, we propose a new asynchronous parallelization scheme to reduce the synchronization overhead when parallelizing SYMGS. We demonstrate the benefit of our techniques by integrating them with the HPCG benchmark and two real-life applications. Evaluation conducted on four architectures, including three ARMv8 and one x86, shows that our techniques greatly surpass the performance of engineer- and vendor-tuned implementations across various workloads and platforms.

5 March 2024 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
FYFan Yuan
Fan Yuan
XYXiaojian Yang
Xiaojian Yang
SLShengguo Li
Shengguo Li
DDDezun Dong
Dezun Dong
CHChun Huang
Chun Huang
ZWZheng Wang
Zheng Wang
Multigrid preconditioned conjugate gradient (MGPCG) is commonly used in high-performance computing (HPC) workloads. However, MGPCG is notoriously challenging to optimize since most of its computation kernels are memory-bounded with low arithmetic intensity and non-trivial communication patterns among parallel processes. This article presents new techniques to improve the data locality and reduce the communication overhead of MGPCG by first merging the kernels of multigrid (MG). We then develop an asynchronous neighboring communication algorithm to reduce the data communications across parallel processes. We demonstrated the benefits of our approach by applying it to the high-performance conjugate gradient (HPCG) benchmark and integrating it with a real-life algebraic multigrid package. We test the resulting software implementations on three ARMv8 and one Intel Xeon system. Experimental results show that our approach leads to a 1.62x-2.54x speedup over the engineer- and vendor-tuned HPCG implementations across various workloads and platforms.

27 February 2024
Verified
Book Chapter
Closed access
PDF file
DBDeshun Bi
Deshun Bi
SLShengguo Li
Shengguo Li
YZYichen Zhang
Yichen Zhang
XYXiaojian Yang
Xiaojian Yang
DDDezun Dong
Dezun Dong

8 June 2025
Verified
Conference Paper
Open access
FYFan Yuan
Fan Yuan
XYXiaojian Yang
Xiaojian Yang
YHYunqing Huang
Yunqing Huang
DDDezun Dong
Dezun Dong
CXChuanfu Xu
Chuanfu Xu
HWHongxia Wang
Hongxia Wang

28 January 2026
Verified
Conference Paper
Open access
XYXiaojian Yang
Xiaojian Yang
YNYuhui Ni
Yuhui Ni
FYFan Yuan
Fan Yuan
SLShengguo Li
Shengguo Li
DDDezun Dong
Dezun Dong
JLJie Liu
Jie Liu

15 November 2025
Verified
Conference Paper
Open access
FYFan Yuan
Fan Yuan
SLShengguo Li
Shengguo Li
XYXiaojian Yang
Xiaojian Yang
YHYunqing Huang
Yunqing Huang
HWHongxia Wang
Hongxia Wang
JLJie Liu
Jie Liu