Task Scheduling in an Asynchronous Distributed Memory Multifrontal Solver
From MaRDI portal
Recommendations
- A fully asynchronous multifrontal solver using distributed dynamic scheduling
- An Asynchronous Parallel Supernodal Algorithm for Sparse Gaussian Elimination
- A parallel sparse direct solver via hierarchical DAG scheduling
- Multifrontal parallel distributed symmetric and unsymmetric solvers
- Task scheduling for parallel sparse Cholesky factorization
Cited in
(12)- A two-dimensional domain decomposition technique for the simulation of quantum-scale devices
- A survey of direct methods for sparse linear systems
- Modeling 1D Distributed-Memory Dense Kernels for an Asynchronous Multifrontal Sparse Solver
- Distributed One-Stage Hessenberg-Triangular Reduction with Wavefront Scheduling
- The secret life of keys: on the calculation of mechanical lock systems
- Preconditioners for large dense matrices in a low-rank format
- scientific article; zbMATH DE number 554772 (Why is no real title available?)
- A fully asynchronous multifrontal solver using distributed dynamic scheduling
- A fast nested dissection solver for Cartesian 3D elliptic problems using hierarchical matrices
- Constructing memory-minimizing schedules for multifrontal methods
- A fast direct solver for elliptic problems on general meshes in 2D
- A parallel sparse direct solver via hierarchical DAG scheduling
This page was built for publication: Task Scheduling in an Asynchronous Distributed Memory Multifrontal Solver
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4651010)