A Parallel Sparse Direct Solver via Hierarchical DAG Scheduling

DOI10.1145/2629641zbMath1369.65046OpenAlexW2028035197WikidataQ113310289 ScholiaQ113310289MaRDI QIDQ5270706

Kyungjoo Kim, Victor Eijkhout

Publication date: 30 June 2017

Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2629641

zbMATH Keywords

Gaussian eliminationsparse matrixdirected acyclic graphdirect methodmulticoretask parallelismsupernodesopenMPmultifrontalLUunassembled hypermatrix

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05) Direct numerical methods for linear systems and matrix inversion (65F05) Numerical algorithms for specific classes of architectures (65Y10)

Related Items (8)

Design and Implementation of a Parallel Markowitz Threshold Algorithm ⋮ Parallel direct solver for solving systems of linear equations resulting from finite element method on multi-core desktops and workstations ⋮ A survey of direct methods for sparse linear systems ⋮ Parallel finite element solver for multi-core computers with shared memory ⋮ UHM ⋮ A Sparse Symmetric Indefinite Direct Solver for GPU Architectures ⋮ An Efficient Multicore Implementation of a Novel HSS-Structured Multifrontal Solver Using Randomized Sampling ⋮ Implementing Multifrontal Sparse Solvers for Multicore Architectures with Sequential Task Flow Runtime Systems

Uses Software

• LAPACK
• PARDISO
• MUMPS
• Cilk
• QUARK

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Fully Asynchronous Multifrontal Solver Using Distributed Dynamic Scheduling
• Comparison of OpenMP 3.0 and other task parallel frameworks on unbalanced task graphs
• Sparse direct factorizations through unassembled hyper-matrices
• Monitoring the stability of the triangular factorization of a sparse matrix
• On fast factorization pivoting methods for sparse symmetric indefinite systems
• Task scheduling for parallel sparse Cholesky factorization
• Parallel implementation of multifrontal schemes
• The analysis of a nested dissection algorithm
• Fine-Grained Multithreading for the Multifrontal $QR$ Factorization of Sparse Matrices
• Programming matrix algorithms-by-blocks for thread-level parallelism
• Direct Methods for Sparse Linear Systems
• The problem of selecting the shape functions for ap-type finite element
• A numerical evaluation of sparse direct solvers for the solution of large sparse symmetric linear systems of equations
• The Multifrontal Solution of Indefinite Sparse Symmetric Linear
• The Multifrontal Method for Sparse Matrix Solution: Theory and Practice
• On Finding Supernodes for Sparse Matrix Computations
• On George’s Nested Dissection Method
• A Supernodal Approach to Sparse Partial Pivoting
• A Mapping Algorithm for Parallel Sparse Cholesky Factorization
• New basis functions and computational procedures for p‐version finite element analysis
• Thepandh-pVersions of the Finite Element Method, Basic Principles and Properties
• The influence of relaxed supernode partitions on the multifrontal method
• A set of level 3 basic linear algebra subprograms
• Design of a Multicore Sparse Cholesky Factorization Using DAGs
• Computing with hp-ADAPTIVE FINITE ELEMENTS

This page was built for publication: A Parallel Sparse Direct Solver via Hierarchical DAG Scheduling