PSPASES: An Efficient and Scalable Parallel Sparse Direct Solver.
Mahesh V. Joshi, George Karypis, Vipin Kumar, Anshul Gupta, Fred G. Gustavson · 1999
Many problems in engineering and scientific domains require solving large sparse systems of linear equations, as a computationally intensivesteptowards the final solution. It has long beenachallenge to develop efficient parallel formulations of sparse direct solvers due to several different complex steps involved in the process. In this paper, we describe PSPASES, one of the first efficient, portable, and robust scalable parallel solvers for sparse symmetric positive definite linear systems that wehavedeveloped. We discuss the algorithmic and implementation issues involved in its development# and present performance and scalability results on CrayT3E and SGI Origin 2000. PSPASES could solve the largest sparse system (1 million equations) ever solved by a direct method, with the highest performance (51 GFLOPS for Cholesky factorization) ever reported.