Browsing by Keywords "Sparse matrixvector multiplication"
Now showing items 18 of 8

Addressing volume and latency overheads in 1dparallel sparse matrixvector multiplication
(Springer, 20170809)The scalability of sparse matrixvector multiplication (SpMV) on distributed memory systems depends on multiple factors that involve different communication cost metrics. The irregular sparsity pattern of the coefficient ... 
Localityaware parallel sparse matrixvector and matrixtransposevector multiplication on manycore processors
(Institute of Electrical and Electronics Engineers, 2016)Sparse matrixvector and matrixtransposevector multiplication (SpMMTV) repeatedly performed as z ← ATx and y ← A z (or y ← A w) for the same sparse matrix A is a kernel operation widely used in various iterative solvers. ... 
A novel method for scaling iterative solvers: avoiding latency overhead of parallel sparsematrix vector multiplies
(Institute of Electrical and Electronics Engineers, 2015)In parallel linear iterative solvers, sparse matrix vector multiplication (SpMxV) incurs irregular pointtopoint (P2P) communications, whereas inner product computations incur regular collective communications. These P2P ... 
Optimizing nonzerobased sparse matrix partitioning models via reducing latency
(Academic Press, 2018)For the parallelization of sparse matrixvector multiplication (SpMV) on distributed memory systems, nonzerobased finegrain and mediumgrain partitioning models attain the lowest communication volume and computational ... 
Reduce operations: send volume balancing while minimizing latency
(IEEE, 2020)Communication hypergraph model was proposed in a twophase setting for encapsulating multiple communication cost metrics (bandwidth and latency), which are proven to be important in parallelizing irregular applications. ... 
Reducing latency cost in 2D sparse matrix partitioning models
(Elsevier BV, 2016)Sparse matrix partitioning is a common technique used for improving performance of parallel linear iterative solvers. Compared to solvers used for symmetric linear systems, solvers for nonsymmetric systems offer more ... 
Reordering methods for exploiting spatial and temporal localities in parallel sparse matrixvector multiplication
(Bilkent University, 201608)Sparse MatrixVector multiplication (SpMV) is a very important kernel operation for many scientific applications. For irregular sparse matrices, the SpMV operation suffers from poor cache performance due to the irregular ... 
Spatiotemporal graph and hypergraph partitioning models for sparse matrixvector multiplication on manycore architectures
(IEEE Computer Society, 2019)There exist graph/hypergraph partitioningbased row/column reordering methods for encoding either spatial or temporal locality for sparse matrixvector multiplication (SpMV) operations. Spatial and temporal hypergraph ...