Xiaojun Lei

Xiaojun Lei

Auto-generated profile, based on publicly available information

Xiaojun Lei

Graduate School of Chinese Academy of Engineering Physics, Beijing, China

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

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

Representative Publications

View All Publications
1 May 2022 in Journal of Computational and Applied Mathematics
Verified
Journal Article
Closed access
XLXiaojun Lei
Xiaojun Lei
TGTongxiang Gu
Tongxiang Gu
SGStef Graillat
Stef Graillat
HJHao Jiang
Hao Jiang
JQJin Qi
Jin Qi

27 February 2023
Verified
Conference Paper
Open access
XLXiaojun Lei
Xiaojun Lei
TGTongxiang Gu
Tongxiang Gu
SGStef Graillat
Stef Graillat
XXXiaowen Xu
Xiaowen Xu
JMjing meng
jing meng
Krylov subspace algorithms are important methods for solving linear systems. In order to efficiently solve large-scale linear systems, parallelism techniques are often applied. However, parallelism often enlarge the non-associativity of floating-point operations, which can lead to non-reproducibility of the computations. This paper compares the performance of the parallel preconditioned BiCGSTAB algorithm implemented with two different libraries (ExBLAS and ReproBLAS) that can ensure the reproducibility of computations. To address the effect of the compiler, we explicitly utilize the FMA instructions. Finally, numerical experiments show that based on two BLAS implementations, the BiCGSTAB algorithms are reproducible. By contrast, the BiCGSTAB algorithm based on ExBLAS is more accurate but more time-consuming than the one based on ReproBLAS.

5 July 2023 in CCF Transactions on High Performance Computing
Verified
Journal Article
Closed access
PDF file
XLXiaojun Lei
Xiaojun Lei
TGTongxiang Gu
Tongxiang Gu
XXXiaowen Xu
Xiaowen Xu

27 February 2025 in HAL
Verified
Preprint
Open access
PDF file
XLXiaojun Lei
Xiaojun Lei
TGTongxiang Gu
Tongxiang Gu
XXXiaowen Xu
Xiaowen Xu
SGStef Graillat
Stef Graillat
Krylov subspace methods are crucial techniques for solving linear systems. To effectively tackle large-scale linear systems, parallelism techniques are frequently utilized. However, the use of parallelism can increase the non-associativity of floating-point operations, potentially resulting in non-reproducibility of the computations. In order to address the issue of non-reproducibility in parallel preconditioned Krylov subspace iterative methods, we investigated the sources of irreproducibility and solutions to achieve reproducibility. The main reason for the irreproducibility in iterative methods is attributed to distributed dot products. To tackle this, we investigated three reproducible Basic Linear Algebra Subprograms (BLAS) as replacements for standard distributed dot products. We utilized OzBLAS, ExBLAS, and ReproBLAS to ensure reproducibility in iterative methods. We combined Jacobi preconditioners and tested and verified on three iterative methods: CG, BiCGSTAB and GMRES. Numerical experiments demonstrate that the iterative method based on OzBLAS is reproducible in a multi-threaded environment. The iterative method based on ExBLAS and ReproB-LAS achieves reproducibility in a multi-process environment. Our evaluation indicated that ReproBLAS performed well in terms of performance, robustness, and parallelism. Therefore, we employ a reproducible iterative method based on ReproBLAS to solve the large-scale algebraic equations resulting from the discretization of the two-dimensional three-temperature heat conduction equation, which arises from practical application problems in the field of laser fusion radiation hydrodynamics. Numerical experiments demonstrate the reproducible solution of the three-temperature heat conduction algebraic equations.