Communication balancing in parallel sparse matrix-vector multiplication
From MaRDI portal
(Redirected from Publication:871152)
Recommendations
- COMMUNICATION BALANCING IN THE PARALLEL GÖTTFERT ALGORITHM
- Encapsulating Multiple Communication-Cost Metrics in Partitioning Sparse Rectangular Matrices for Parallel Matrix-Vector Multiplies
- scientific article; zbMATH DE number 4070168
- Communications oriented programming of parallel iterative solutions of sparse linear systems
- Modelling and analysis of communication overhead for parallel matrix algorithms
- Communication efficient matrix multiplication on hypercubes
- Communication-efficient matrix multiplication on hypercubes
- Towards a fast parallel sparse symmetric matrix-vector multiplication
Cited in
(13)- Simultaneous Computational and Data Load Balancing in Distributed-Memory Setting
- scientific article; zbMATH DE number 16398 (Why is no real title available?)
- Encapsulating Multiple Communication-Cost Metrics in Partitioning Sparse Rectangular Matrices for Parallel Matrix-Vector Multiplies
- Matrix Balancing on a Massively Parallel Connection Machine
- A Matrix Partitioning Interface to PaToH in MATLAB
- COMMUNICATION BALANCING IN THE PARALLEL GÖTTFERT ALGORITHM
- Communication efficient matrix multiplication on hypercubes
- Improving unstructured mesh partitions for multiple criteria using mesh adjacencies
- 1.5D parallel sparse matrix-vector multiply
- scientific article; zbMATH DE number 4151732 (Why is no real title available?)
- Sparse Matrix Computations on Parallel Processor Arrays
- Approximations for the general block distribution of a matrix
- Improving the communication pattern in matrix-vector operations for large scale-free graphs by disaggregation
This page was built for publication: Communication balancing in parallel sparse matrix-vector multiplication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q871152)