Assignment and scheduling in parallel matrix factorization
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 18296
- Task scheduling for parallel sparse Cholesky factorization
- scientific article; zbMATH DE number 4003353
- Implementation of some concurrent algorithms for matrix factorization
- Computational models and task scheduling for parallel sparse Cholesky factorization
- scientific article; zbMATH DE number 641618
- scientific article; zbMATH DE number 815482
Cites work
- scientific article; zbMATH DE number 3848585 (Why is no real title available?)
- Complexity of dense-linear-system solution on a multiprocessor ring
- Data-flow algorithms for parallel matrix computation
- Optimal Parallel Scheduling of Gaussian Elimination DAG's
- Parallel Cholesky factorization on a shared-memory multiprocessor
- Torus data flow for parallel computation of missized matrix problems
Cited in
(6)- scientific article; zbMATH DE number 18296 (Why is no real title available?)
- A parallel boundary element formulation for determining effective properties of heterogeneous media
- scientific article; zbMATH DE number 720649 (Why is no real title available?)
- Task scheduling for parallel sparse Cholesky factorization
- Independent set orderings for parallel matrix factorization by Gaussian elimination
- Avoiding the square-root bottleneck in the Choleski factorization of a matrix on a parallel computer
This page was built for publication: Assignment and scheduling in parallel matrix factorization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1072330)