1.5D parallel sparse matrix-vector multiply
From MaRDI portal
Publication:4602886
bipartite vertex covercombinatorial scientific computingsparse matrix partitioningdirected hypergraph modelparallel sparse matrix-vector multiplication
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05) Iterative numerical methods for linear systems (65F10) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Recommendations
- Encapsulating Multiple Communication-Cost Metrics in Partitioning Sparse Rectangular Matrices for Parallel Matrix-Vector Multiplies
- On two-dimensional sparse matrix partitioning: models, methods, and a recipe
- A Two-Dimensional Data Distribution Method for Parallel Sparse Matrix-Vector Multiplication
- Communication balancing in parallel sparse matrix-vector multiplication
- Sparse matrix-vector multiply algorithm based on overlapping computation and communication and application in AMG
Cites work
- A Two-Dimensional Data Distribution Method for Parallel Sparse Matrix-Vector Multiplication
- Applications of the Dulmage--Mendelsohn Decomposition and Network Flow to Graph Bisection Improvement
- Benchmarking optimization software with performance profiles.
- Improving the communication pattern in matrix-vector operations for large scale-free graphs by disaggregation
- On two-dimensional sparse matrix partitioning: models, methods, and a recipe
- Revisiting Hypergraph Models for Sparse Matrix Partitioning
- The University of Florida sparse matrix collection
This page was built for publication: 1.5D parallel sparse matrix-vector multiply
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4602886)
