Robust memory-aware mappings for parallel multifrontal factorizations

DOI10.1137/130938505MaRDI QIDQ2815696zbMATHOpenAlexWikidataFDO

Authors E. Agullo, Alfredo Buttari, Abdou Guermouche, François-Henry Rouet, Patrick R. Amestoy, Jean-Yves L'Excellent

Publication date 30 June 2016

Published in SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/3d03b4548ce01cbed75c61a74c26b19cc2b746c0

zbMATH Keywords

direct methodstask schedulingsparse matrix algorithms

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05)

Recommendations

• Constructing memory-minimizing schedules for multifrontal methods
• Parallel sparse QR factorization on shared memory architectures
• scientific article; zbMATH DE number 434523
• A distributed-memory randomized structured multifrontal method for sparse direct solutions
• Data-Parallel Sparse Factorization

Cites work

• scientific article; zbMATH DE number 1033441 (Why is no real title available?)
• A Mapping Algorithm for Parallel Sparse Cholesky Factorization
• A New Implementation of Sparse Gaussian Elimination
• A fully asynchronous multifrontal solver using distributed dynamic scheduling
• An Application of Generalized Tree Pebbling to Sparse Matrix Factorization
• Communication results for parallel sparse Cholesky factorization on a hypercube
• Constructing memory-minimizing schedules for multifrontal methods
• Efficient scalable algorithms for solving dense linear systems with hierarchically semiseparable structures
• Nested Dissection of a Regular Finite Element Mesh
• On the storage requirement in the out-of-core multifrontal method for sparse factorization
• Reducing the I/O Volume in Sparse Out-of-core Multifrontal Methods
• The Multifrontal Solution of Indefinite Sparse Symmetric Linear
• The Multifrontal Solution of Unsymmetric Sets of Linear Equations
• The Role of Elimination Trees in Sparse Factorization
• The optimal control approach to generalized multiprocessor scheduling

Cited in

(4)

• Constructing memory-minimizing schedules for multifrontal methods
• Combining sparse approximate factorizations with mixed-precision iterative refinement
• Minimizing I/Os in Out-of-Core Task Tree Scheduling
• Distributed-memory hierarchical interpolative factorization

This page was built for publication: Robust memory-aware mappings for parallel multifrontal factorizations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2815696)