Robust Memory-Aware Mappings for Parallel Multifrontal Factorizations

DOI10.1137/130938505zbMath1360.65134WikidataQ114074342 ScholiaQ114074342MaRDI QIDQ2815696

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

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 methods; task scheduling; sparse matrix algorithms

Mathematics Subject Classification ID

65F50: Computational methods for sparse matrices

65Y05: Parallel numerical computation

Cites Work

• Unnamed Item
• A Fully Asynchronous Multifrontal Solver Using Distributed Dynamic Scheduling
• Communication results for parallel sparse Cholesky factorization on a hypercube
• The optimal control approach to generalized multiprocessor scheduling
• Reducing the I/O Volume in Sparse Out-of-core Multifrontal Methods
• The Multifrontal Solution of Unsymmetric Sets of Linear Equations
• The Role of Elimination Trees in Sparse Factorization
• Constructing memory-minimizing schedules for multifrontal methods
• The Multifrontal Solution of Indefinite Sparse Symmetric Linear
• On the storage requirement in the out-of-core multifrontal method for sparse factorization
• An Application of Generalized Tree Pebbling to Sparse Matrix Factorization
• A New Implementation of Sparse Gaussian Elimination
• A Mapping Algorithm for Parallel Sparse Cholesky Factorization
• Efficient Scalable Algorithms for Solving Dense Linear Systems with Hierarchically Semiseparable Structures
• Nested Dissection of a Regular Finite Element Mesh