Partitioning Rectangular and Structurally Unsymmetric Sparse Matrices for Parallel Processing
From MaRDI portal
Recommendations
- A Two-Dimensional Data Distribution Method for Parallel Sparse Matrix-Vector Multiplication
- Encapsulating Multiple Communication-Cost Metrics in Partitioning Sparse Rectangular Matrices for Parallel Matrix-Vector Multiplies
- Parallel algorithm of sparse matrix multiplying
- scientific article; zbMATH DE number 4066229
- Techniques for parallel manipulation of sparse matrices
Cited in
(9)- Graph bisection revisited
- Parallelization of population-based multi-objective meta-heuristics: an empirical study
- Encapsulating Multiple Communication-Cost Metrics in Partitioning Sparse Rectangular Matrices for Parallel Matrix-Vector Multiplies
- scientific article; zbMATH DE number 1185315 (Why is no real title available?)
- Compact linearization for binary quadratic problems
- An efficient semidefinite programming relaxation for the graph partition problem
- Load balancing fictions, falsehoods and fallacies
- Optimal block-tridiagonalization of matrices for coherent charge transport
- Semidefinite programming and eigenvalue bounds for the graph partition problem
This page was built for publication: Partitioning Rectangular and Structurally Unsymmetric Sparse Matrices for Parallel Processing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4509819)
