Abstract
We present an out-of-core sparse direct solver for unsymmetric linear systems. The solver factors the coefficient matrix A into A = PLU using Gaussian elimination with partial pivoting. It assumes that A fits within main memory, but it stores the L and U factors on disk (that is, in files). Experimental results indicate that on small to moderately-large matrices (whose factors fit or almost fit in main memory), our code achieves high performance, comparable to that of SuperLU. In some of these cases it is somewhat slower than SuperLU due to overheads associated with the out-of-core behavior of the algorithm (in particular the fact that it always writes the factors to files), but not by a large factor. But in other cases it is faster than SuperLU, probably due to more efficient use of the cache. However, it is able to factor matrices whose factors are much larger than main memory, although at lower computational rates.
This research was supported by an IBM Faculty Partnership Award, by grant 848/04 from the Israel Science Foundation (founded by the Israel Academy of Sciences and Humanities), and by grant 2002261 from the United-States-Israel Binational Science Foundation.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Avron, H., Shklarski, G., Toledo, S.: Parallel unsymmetric-pattern multifrontal sparse LU with column preordering. ACM Transactions on Mathematical Software 34(2) (2008)
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press and McGraw-Hill, Cambridge (2001)
Davis, T.A.: A column pre-ordering strategy for the unsymmetric-pattern multifrontal method. ACM Trans. Math. Softw. 30(2), 165–195 (2004)
Demmel, J.W., Eisenstat, S.C., Gilbert, J.R., Li, X.S., Liu, J.W.H.: A supernodal approach to sparse partial pivoting. SIAM Journal on Matrix Analysis and Applications 20, 720–755 (1999)
Dongarra, J.J., Cruz, J.D., Hammarling, S., Duff, I.: Algorithm 656: An extended set of Fortran basic linear algebra subprograms. ACM Transactions on Mathematical Software 14, 18–32 (1988)
Dongarra, J.J., Cruz, J.D., Hammarling, S., Duff, I.: An extended set of Fortran basic linear algebra subprograms. ACM Transactions on Mathematical Software 14, 1–17 (1988)
Dongarra, J.J., Cruz, J.D., Hammarling, S., Duff, I.: Algorithm 679: A set of level 3 basic linear algebra subprograms. ACM Transactions on Mathematical Software 16(1), 18–28 (1990)
Dongarra, J.J., Cruz, J.D., Hammarling, S., Duff, I.: A set of level 3 basic linear algebra subprograms. ACM Transactions on Mathematical Software 16(1), 1–17 (1990)
Gilbert, J.R., Peierls, T.: Sparse partial pivoting in time proportional to arithmetic operations. SIAM Journal on Scientific and Statistical Computing 9, 862–874 (1988)
Gilbert, J.R., Toledo, S.: High-performance out-of-core sparse LU factorization. In: Proceedings of the 9th SIAM Conference on Parallel Processing for Scientific Computing, San-Antonio, Texas, 10 pages on CDROM (1999)
Reid, J.K., Scott, J.A.: The design of an out-of-core multifrontal solver for the 21st century. In: Proceedings of the Workshop on State-of-the-Art in Scientific and Paralell Computing, Umea, Sweden (June 2006)
Rotkin, V., Toledo, S.: The design and implementation of a new out-of-core sparse Cholesky factorization method. ACM Transactions on Mathematical Software 30, 19–46 (2004)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Toledo, S., Uchitel, A. (2008). A Supernodal Out-of-Core Sparse Gaussian-Elimination Method. In: Wyrzykowski, R., Dongarra, J., Karczewski, K., Wasniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2007. Lecture Notes in Computer Science, vol 4967. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68111-3_76
Download citation
DOI: https://doi.org/10.1007/978-3-540-68111-3_76
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68105-2
Online ISBN: 978-3-540-68111-3
eBook Packages: Computer ScienceComputer Science (R0)