Towards an accurate performance modeling of parallel sparse factorization

作     者：Grigori, Laura Li, Xiaoye S. 

作者机构：Lawrence Berkeley Natl Lab Berkeley CA 94720 USA INRIA Futurs F-91893 Orsay France 

出 版 物：《APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING》 (工程、通信与计算应用代数)

年 卷 期：2007年第18卷第3期

页      面：241-261页

核心收录：

学科分类：07[理学] 070104[理学-应用数学] 0701[理学-数学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

主　　题：parallel sparse factorization performance modeling distributed parallel machine 

摘      要：We present a simulation-based performance model to analyze a parallel sparse LU factorization algorithm on modern cached-based, high-end parallel architectures. We consider supernodal right-looking parallel factorization on a bi-dimensional grid of processors, that uses static pivoting. Our model characterizes the algorithmic behavior by taking into account the underlying processor speed, memory system performance, as well as the interconnect speed. The model is validated using the implementation in the SuperLU_DIST linear system solver, the sparse matrices from real application, and an IBM POWER3 parallel machine. Our modeling methodology can be adapted to study performance of other types of sparse factorizations, such as Cholesky or QR, and on different parallel machines.