Browsing by Keywords "Matrix reordering"
Now showing items 1-3 of 3
-
Cache locality exploiting methods and models for sparse matrix-vector multiplication
(Bilkent University, 2009)The sparse matrix-vector multiplication (SpMxV) is an important kernel operation widely used in linear solvers. The same sparse matrix is multiplied by a dense vector repeatedly in these solvers to solve a system of ... -
Locality-aware parallel sparse matrix-vector and matrix-transpose-vector multiplication on many-core processors
(Institute of Electrical and Electronics Engineers, 2016)Sparse matrix-vector and matrix-transpose-vector 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. ... -
Reordering methods for exploiting spatial and temporal localities in parallel sparse matrix-vector multiplication
(Bilkent University, 2016-08)Sparse Matrix-Vector 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 ...
