Abstract
The availability of large-scale computing platforms comprised of tens of thousands of multicore processors motivates the need for the next generation of highly scalable sparse linear system solvers. These solvers must optimize parallel performance, processor (serial) performance, as well as memory requirements, while being robust across broad classes of applications and systems. In this paper, we present a new parallel solver that combines the desirable characteristics of direct methods (robustness) and effective iterative solvers (low computational cost), while alleviating their drawbacks (memory requirements, lack of robustness). Our proposed hybrid solver is based on the general sparse solver PARDISO, and the “Spike” family of hybrid solvers. The resulting algorithm, called PSPIKE, is as robust as direct solvers, more reliable than classical preconditioned Krylov subspace methods, and much more scalable than direct sparse solvers. We support our performance and parallel scalability claims using detailed experimental studies and comparison with direct solvers, as well as classical preconditioned Krylov methods.
This work was supported by grants from NSF (NSF-CCF-0635169), DARPA/AFRL (FA8750-06-1-0233), and a gift from Intel and partially supported by the Swiss National Science Foundation under grant 200021 − 117745/1.
Chapter PDF
Similar content being viewed by others
References
Chen, S.C., Kuck, D.J., Sameh, A.H.: Practical parallel band triangular system solvers. ACM Transactions on Mathematical Software 4(3), 270–277 (1978)
Lawrie, D.H., Sameh, A.H.: The computation and communication complexity of a parallel banded system solver. ACM Trans. Math. Softw. 10(2), 185–195 (1984)
Berry, M.W., Sameh, A.: Multiprocessor schemes for solving block tridiagonal linear systems. The International Journal of Supercomputer Applications 1(3), 37–57 (1988)
Dongarra, J.J., Sameh, A.H.: On some parallel banded system solvers. Parallel Computing 1(3), 223–235 (1984)
Polizzi, E., Sameh, A.H.: A parallel hybrid banded system solver: the spike algorithm. Parallel Comput. 32(2), 177–194 (2006)
Polizzi, E., Sameh, A.H.: Spike: A parallel environment for solving banded linear systems. Computers & Fluids 36(1), 113–120 (2007)
Sameh, A.H., Sarin, V.: Hybrid parallel linear system solvers. Inter. J. of Comp. Fluid Dynamics 12, 213–223 (1999)
Schenk, O., Gärtner, K.: Solving unsymmetric sparse systems of linear equations with pardiso. Future Generation Computer Systems 20(3), 475–487 (2004) Selected numerical algorithms
Schenk, O., Gärtner, K.: On fast factorization pivoting methods for sparse symmetric indefinite systems. Electronic Transactions on Numerical Analysis 23, 158–179 (2006)
van der Vorst, H.A.: Bi-cgstab: a fast and smoothly converging variant of bi-cg for the solution of nonsymmetric linear systems. SIAM J. Sci. Stat. Comput. 13(2), 631–644 (1992)
Mikkelsen, C.C.K., Manguoglu, M.: Analysis of the truncated spike algorithm. SIAM Journal on Matrix Analysis and Applications 30(4), 1500–1519 (2008)
Duff, I.S.: Algorithm 575: Permutations for a zero-free diagonal [f1]. ACM Trans. Math. Softw. 7(3), 387–390 (1981)
Duff, I.S., Koster, J.: The design and use of algorithms for permuting large entries to the diagonal of sparse matrices. SIAM Journal on Matrix Analysis and Applications 20(4), 889–901 (1999)
HSL: A collection of Fortran codes for large-scale scientific computation (2004), http://www.cse.scitech.ac.uk/nag/hsl/
Hu, Y., Scott, J.: HSL_MC73: a fast multilevel Fiedler and profile reduction code. Technical Report RAL-TR-2003-036 (2003)
Davis, T.A.: University of Florida sparse matrix collection. NA Digest (1997)
Benzi, M., Haws, J.C., Tuma, M.: Preconditioning highly indefinite and nonsymmetric matrices. SIAM J. Sci. Comput. 22(4), 1333–1353 (2000)
Karypis, G., Kumar, V.: A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput. 20(1), 359–392 (1998)
Bollhöfer, M., Saad, Y., Schenk, O.: ILUPACK Volume 2.1—Preconditioning Software Package (May 2006), http://ilupack.tu-bs.de
Wächter, A., Biegler, L.T.: On the implementation of a primal-dual interior point filter line search algorithm for large-scale nonlinear programming. Mathematical Programming 106(1), 25–57 (2006)
Amestoy, P.R., Guermouche, A., L’Excellent, J.Y., Pralet, S.: Hybrid scheduling for the parallel solution of linear systems. Parallel Comput. 32(2), 136–156 (2006)
Amestoy, P.R., Duff, I.S., L’Excellent, J.Y., Koster, J.: A fully asynchronous multifrontal solver using distributed dynamic scheduling. SIAM J. Matrix Anal. Appl. 23(1), 15–41 (2001)
Amestoy, P.R., Duff, I.S.: Multifrontal parallel distributed symmetric and unsymmetric solvers. Comput. Methods Appl. Mech. Eng. 184, 501–520 (2000)
Schenk, O., Manguoglu, M., Sameh, A., Christian, M., Sathe, M.: Parallel scalable PDE-constrained optimization: antenna identification in hyperthermia cancer treatment planning. Computer Science - Research and Development 23(3), 177–183 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Manguoglu, M., Sameh, A.H., Schenk, O. (2009). PSPIKE: A Parallel Hybrid Sparse Linear System Solver. In: Sips, H., Epema, D., Lin, HX. (eds) Euro-Par 2009 Parallel Processing. Euro-Par 2009. Lecture Notes in Computer Science, vol 5704. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03869-3_74
Download citation
DOI: https://doi.org/10.1007/978-3-642-03869-3_74
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03868-6
Online ISBN: 978-3-642-03869-3
eBook Packages: Computer ScienceComputer Science (R0)