1.5D Parallel Sparse Matrix-Vector Multiply
DOI10.1137/16M1105591zbMath1379.05074OpenAlexW2787034813MaRDI QIDQ4602886
Enver Kayaaslan, Cevdet Aykanat, Bora Uçar
Publication date: 7 February 2018
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/16m1105591
bipartite vertex covercombinatorial scientific computingsparse matrix partitioningdirected hypergraph modelparallel sparse matrix-vector multiplication
Computational methods for sparse matrices (65F50) Hypergraphs (05C65) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Iterative numerical methods for linear systems (65F10) Parallel numerical computation (65Y05)
Uses Software
Cites Work
- Improving the Communication Pattern in Matrix-Vector Operations for Large Scale-Free Graphs by Disaggregation
- The university of Florida sparse matrix collection
- On Two-Dimensional Sparse Matrix Partitioning: Models, Methods, and a Recipe
- Applications of the Dulmage--Mendelsohn Decomposition and Network Flow to Graph Bisection Improvement
- A Two-Dimensional Data Distribution Method for Parallel Sparse Matrix-Vector Multiplication
- Revisiting Hypergraph Models for Sparse Matrix Partitioning
- Benchmarking optimization software with performance profiles.
This page was built for publication: 1.5D Parallel Sparse Matrix-Vector Multiply
