On general row merging schemes for sparse given transformations
SIAM Journal on Scientific and Statistical Computing
The Multifrontal Solution of Indefinite Sparse Symmetric Linear
ACM Transactions on Mathematical Software (TOMS)
Data Structures and Algorithms
Data Structures and Algorithms
Computer Solution of Large Sparse Positive Definite
Computer Solution of Large Sparse Positive Definite
ACM SIGNUM Newsletter
The influence of relaxed supernode partitions on the multifrontal method
ACM Transactions on Mathematical Software (TOMS)
The multifrontal method and paging in sparse Cholesky factorization
ACM Transactions on Mathematical Software (TOMS)
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Intent, perception, and out-of-core visualization applied to terrain
Proceedings of the conference on Visualization '98
Real-time visualization of scalably large collections of heterogeneous objects (case study)
VIS '99 Proceedings of the conference on Visualization '99: celebrating ten years
The design of I/O-efficient sparse direct solvers
Proceedings of the 2001 ACM/IEEE conference on Supercomputing
Out-of-Core Streamline Visualization on Large Unstructured Meshes
IEEE Transactions on Visualization and Computer Graphics
Parallel and Fully Recursive Multifrontal Supernodal Sparse Cholesky
ICCS '02 Proceedings of the International Conference on Computational Science-Part II
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
The design and implementation of a new out-of-core sparse cholesky factorization method
ACM Transactions on Mathematical Software (TOMS)
Parallel and fully recursive multifrontal sparse Cholesky
Future Generation Computer Systems - Special issue: Selected numerical algorithms
Constructing memory-minimizing schedules for multifrontal methods
ACM Transactions on Mathematical Software (TOMS)
An out-of-core sparse Cholesky solver
ACM Transactions on Mathematical Software (TOMS)
On the I/O Volume in Out-of-Core Multifrontal Methods with a Flexible Allocation Scheme
High Performance Computing for Computational Science - VECPAR 2008
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
Managing data-movement for effective shared-memory parallelization of out-of-core sparse solvers
SC '12 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
Model and complexity results for tree traversals on hybrid platforms
Euro-Par'13 Proceedings of the 19th international conference on Parallel Processing
| Hi-index | 0.00 |
Two techniques are introduced to reduce the working storage requirement for the recent multifrontal method of Duff and Reid used in the sparse out-of-core factorization of symmetric matrices. For a given core size, the reduction in working storage allows some large problems to be solved without having to use auxiliary storage for the working arrays. Even if the working arrays exceed the core size, it will reduce the amount of input-output traffic necessary to manipulate the working vectors. Experimental results are provided to demonstrate significant storage reduction on practical problems using the proposed techniques.