Abstract
High performance sparse direct solvers are often a method of choice in various simulation problems. However, they require a large amount of memory compared to iterative methods. In this context, out-of-core solvers must be employed, where disks are used when the storage requirements are too large with respect to the physical memory available. In this paper, we study how to minimize the I/O requirements in the multifrontal method, a particular direct method to solve large-scale problems efficiently. Experiments on large real-life problems also show that the volume of I/O obtained when minimizing the storage requirement can be significantly reduced by applying algorithms designed to reduce the I/O volume.
Partially supported by ANR project SOLSTICE, ANR-06-CIS6-010.
This is a preview of subscription content, log in via an institution to check access.
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
The BCSLIB Mathematical/Statistical Library. http://www.boeing.com/phantom/bcslib/
Agullo, E., Guermouche, A., L’Excellent, J.-Y.: A preliminary out-of-core extension of a parallel multifrontal solver. In: EuroPar 2006 Parallel Processing, pp. 1053–1063 (2006)
Agullo, E., Guermouche, A., L’Excellent, J.-Y.: Towards a parallel out-of-core multifrontal solver: Preliminary study. Research report 6120, INRIA, 02, Also appeared as LIP report RR2007-06 (2007)
Agullo, E., Guermouche, A., L’Excellent, J.-Y.: Reducing the I/O volume in an out-of-core sparse multifrontal solver. Research Report 6207, INRIA, 05, Also appeared as LIP report RR2007-22 (2007)
Amestoy, P.R., Guermouche, A., L’Excellent, J.-Y., Pralet, S.: Hybrid scheduling for the parallel solution of linear systems. Parallel Computing 32(2), 136–156 (2006)
Amestoy, P.R., Puglisi, C.: An unsymmetrized multifrontal LU factorization. SIAM Journal on Matrix Analysis and Applications 24, 553–569 (2002)
Dobrian, F.: External Memory Algorithms for Factoring Sparse Matrices. PhD thesis, Old Dominion University (2001)
Dobrian, F., Pothen, A.: Oblio: a sparse direct solver library for serial and parallel computations. Technical report, Old Dominion University (2000)
Duff, I.S., Reid, J.K.: MA27—a set of Fortran subroutines for solving sparse symmetric sets of linear equations. Technical Report R.10533, AERE, Harwell, England (1982)
Guermouche, A., L’Excellent, J.-Y.: Constructing memory-minimizing schedules for multifrontal methods. ACM Transactions on Mathematical Software 32(1), 17–32 (2006)
Guermouche, A., L’Excellent, J.-Y., Utard, G.: Impact of reordering on the memory of a multifrontal solver. Parallel Computing 29(9), 1191–1218 (2003)
Hénon, P., Ramet, P., Roman, J.: PaStiX: A High-Performance Parallel Direct Solver for Sparse Symmetric Definite Systems. Parallel Computing 28(2), 301–321 (2002)
Liu, J.W.H.: On the storage requirement in the out-of-core multifrontal method for sparse factorization. ACM Transactions on Mathematical Software 12, 127–148 (1986)
Liu, J.W.H.: The multifrontal method and paging in sparse Cholesky factorization. ACM Transactions on Mathematical Software 15, 310–325 (1989)
Reid, J.K., Scott, J.A.: An out-of-core sparse Cholesky solver. Technical report, Rutherford Appleton Laboratory (2006)
Rothberg, E., Schreiber, R.: Efficient methods for out-of-core sparse Cholesky factorization. SIAM Journal on Scientific Computing 21(1), 129–144 (1999)
Rotkin, V., Toledo, S.: The design and implementation of a new out-of-core sparse Cholesky factorization method. ACM Trans. Math. Softw. 30(1), 19–46 (2004)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Agullo, E., Guermouche, A., L’Excellent, JY. (2007). Reducing the I/O Volume in an Out-of-Core Sparse Multifrontal Solver. In: Aluru, S., Parashar, M., Badrinath, R., Prasanna, V.K. (eds) High Performance Computing – HiPC 2007. HiPC 2007. Lecture Notes in Computer Science, vol 4873. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77220-0_9
Download citation
DOI: https://doi.org/10.1007/978-3-540-77220-0_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77219-4
Online ISBN: 978-3-540-77220-0
eBook Packages: Computer ScienceComputer Science (R0)