The role of elimination trees in sparse factorization
SIAM Journal on Matrix Analysis and Applications
Task scheduling for parallel sparse Cholesky factorization
International Journal of Parallel Programming
Modification of the minimum-degree algorithm by multiple elimination
ACM Transactions on Mathematical Software (TOMS)
An Approximate Minimum Degree Ordering Algorithm
SIAM Journal on Matrix Analysis and Applications
Node Selection Strategies for Bottom-Up Sparse Matrix Ordering
SIAM Journal on Matrix Analysis and Applications
Performance of Greedy Ordering Heuristics for Sparse Cholesky Factorization
SIAM Journal on Matrix Analysis and Applications
Efficient Methods for Out-of-Core Sparse Cholesky Factorization
SIAM Journal on Scientific Computing
The Multifrontal Solution of Indefinite Sparse Symmetric Linear
ACM Transactions on Mathematical Software (TOMS)
Computer Solution of Large Sparse Positive Definite
Computer Solution of Large Sparse Positive Definite
On Algorithms For Permuting Large Entries to the Diagonal of a Sparse Matrix
SIAM Journal on Matrix Analysis and Applications
A Fully Asynchronous Multifrontal Solver Using Distributed Dynamic Scheduling
SIAM Journal on Matrix Analysis and Applications
Proceedings of the 11 IPPS/SPDP'99 Workshops Held in Conjunction with the 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing
LAPACK Working Note 95: ScaLAPACK: A Portable Linear Algebra Library for Distributed Memory Computers -- Design Issues and Performance
Adaptive paging for a multifrontal solver
Proceedings of the 18th annual international conference on Supercomputing
Constructing memory-minimizing schedules for multifrontal methods
ACM Transactions on Mathematical Software (TOMS)
Reducing the I/O volume in an out-of-core sparse multifrontal solver
HiPC'07 Proceedings of the 14th international conference on High performance computing
Reducing the I/O Volume in Sparse Out-of-core Multifrontal Methods
SIAM Journal on Scientific Computing
Multifrontal QR factorization for multicore architectures over runtime systems
Euro-Par'13 Proceedings of the 19th international conference on Parallel Processing
| Hi-index | 0.01 |
This paper is concerned with the memory usage of sparse direct solvers, which depends on the ordering of the unknowns and the scheduling of the computational tasks. We study the influence of state-of-the-art sparse matrix reordering techniques on the memory usage of a multifrontal solver. Concerning the scheduling, the memory usage depends on the tree traversal and how the tasks are assigned to the processors. We analyze the memory scalability when a dynamic scheduling strategy mainly based on the balance of the workload is used. Finally we give hints to improve the parallel memory behaviour.