Abstract
We present and analyze a general algorithm which computes an efficient static scheduling of block computations for a parallel L.D.Lt factorization of sparse symmetric positive definite systems based on a combination of 1D and 2D block distributions. Our solver uses a supernodal fan-in approach and is fully driven by this scheduling. We give an overview of the algorithm and present performance results and comparisons with PSPASES on an IBM-SP2 with 120 MHz Pow er2SC nodes for a collection of irregular problems. © 2000 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Hénon, P., Ramet, P., & Roman, J. (2000). PaStiX : A parallel sparse direct solver based on a static scheduling for mixed 1D/2D block distributions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1800 LNCS, pp. 519–525). Springer Verlag. https://doi.org/10.1007/3-540-45591-4_70
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
