首页|期刊导航|Journal of Computer Science & Technology|Cholesky Parallel Decomposition Optimization Algorithm Based on ScaLAPACK

Cholesky Parallel Decomposition Optimization Algorithm Based on ScaLAPACKOA

中文摘要

The scalable linear algebra package(ScaLAPACK)is a critical library for parallel computing on distributed-memory systems,enabling the development of numerous scientific applications that depend on robust linear algebra operations.However,for specific computations such as the Cholesky decomposition,the native ScaLAPACK routines are not communication-optimal and fail to fully leverage the capabilities of modern parallel architectures.This paper proposes the Parallel Cholesky Factorization(PCF)optimization algorithm designed to address these limitations within the ScaLAPACK framework.The PCF algorithm enhances performance and load balancing by strategically differentiating data partitions across processes.It involves a temporary redistribution of computational workloads to a root process,which performs a concentrated calculation before redistributing the results.This approach ensures a more balanced utilization of CPU resources.Experimental evaluation is conducted on both Intel and Kunpeng processor platforms.The first set of experiments demonstrates that the PCF algorithm achieves an average performance improvement of 30%over the native ScaLAPACK algorithm on the Intel platform under optimized process and thread configurations.The second comparative experiment shows that the PCF algorithm on the Kunpeng platform achieves an average computational efficiency increase of 200%and 50%under different thread configurations,respectively,significantly outperforming the Intel math kernel library(MKL)on the Intel platform.These results confirm that the proposed optimization effectively enhances performance and portability across diverse modern computing environments.

He Xu;Tao Zhou;Peng Li;Fang-Fang Qin;Yi-Mu Ji

School of Computer Science,Nanjing University of Posts and Telecommunications,Nanjing 210023,China Jiangsu Engineering Research Center of High Performance Computing and Intelligent Processing,Nanjing University of Posts and Telecommunications,Nanjing 210023,ChinaSchool of Computer Science,Nanjing University of Posts and Telecommunications,Nanjing 210023,China Jiangsu Engineering Research Center of High Performance Computing and Intelligent Processing,Nanjing University of Posts and Telecommunications,Nanjing 210023,ChinaSchool of Computer Science,Nanjing University of Posts and Telecommunications,Nanjing 210023,China Jiangsu Engineering Research Center of High Performance Computing and Intelligent Processing,Nanjing University of Posts and Telecommunications,Nanjing 210023,ChinaSchool of Science,Nanjing University of Posts and Telecommunications,Nanjing 210023,ChinaSchool of Computer Science,Nanjing University of Posts and Telecommunications,Nanjing 210023,China Jiangsu Engineering Research Center of High Performance Computing and Intelligent Processing,Nanjing University of Posts and Telecommunications,Nanjing 210023,China

信息技术与安全科学

scalable linear algebra package(ScaLAPACK)Choleskyparallel computingmath kernel library

《Journal of Computer Science & Technology》 2026 (3)

P.1009-1023,15

supported by the National Natural Science Foundation of China under Grant Nos.62102194 and 62102196the Six Talent Peaks Project of Jiangsu Province of China under Grant No.RJFW-111the Postgraduate Research and Practice Innovation Program of Jiangsu Province of China under Grant Nos.SJCX22-0267,SJCX22-0275,2022w241,2022w243.

10.1007/s11390-025-5111-y

评论