#### Filter Results:

#### Publication Year

2011

2016

#### Publication Type

#### Co-author

#### Publication Venue

#### Data Set Used

#### Key Phrases

Learn More

- Kadir Akbudak, Enver Kayaaslan, Cevdet Aykanat
- SIAM J. Scientific Computing
- 2013

Sparse matrix-vector multiplication (SpMxV) is a kernel operation widely used in iterative linear solvers. The same sparse matrix is multiplied by a dense vector repeatedly in these solvers. Matrices with irregular sparsity patterns make it difficult to utilize cache locality effectively in SpMxV computations. In this work, we investigate single-and… (More)

- Kadir Akbudak, Cevdet Aykanat
- SIAM J. Scientific Computing
- 2014

The sparse matrix-vector multiplication (SpMxV) is a kernel operation widely used in iterative linear solvers. The same sparse matrix is multiplied by a dense vector repeatedly in these solvers. Matrices with irregular sparsity patterns make it difficult to utilize cache locality effectively in SpMxV computations. In this work, we investigate single-and… (More)

- M. Ozan Karsavuran, Kadir Akbudak, Cevdet Aykanat
- IEEE Transactions on Parallel and Distributed…
- 2016

Sparse matrix-vector and matrix-transpose-vector multiplication (SpMM<sup>T</sup>V) repeatedly performed as z←A<sup>T</sup><sub>x</sub> and y← A z (or y A w) for the same sparse matrix A is a kernel operation widely used in various iterative solvers. One important optimization for serial SpMM<sup>T</sup>V is reusing A-matrix nonzeros, which… (More)

We acknowledge PRACE for the Preparatory Access Call Type B (resource) awards for our applications numbered 2010PA0930 and 2010PA2149. The library presented in this work has been developed and tested using these awarded resources, JUQUEEN at Jülich Supercomputing Centre and SuperMUC at Leibniz Supercomputing Center, all of which are based in Germany.

- Kadir Akbudak, Enver Kayaaslan, Cevdet Aykanat
- ArXiv
- 2012

- Kadir Akbudak, Enver Kayaaslan, Cevdet Aykanat
- ArXiv
- 2012

The sparse matrix-vector multiplication (SpMxV) is a kernel operation widely used in iterative linear solvers. The same sparse matrix is multiplied by a dense vector repeatedly in these solvers. Matrices with irregular sparsity patterns make it difficult to utilize cache locality effectively in SpMxV computations. In this work, we investigate single-and… (More)

The sparse matrix-vector multiplication (SpMxV) is a kernel operation widely used in iterative linear solvers. The same sparse matrix is multiplied by a dense vector repeatedly in these solvers. Matrices with irregular sparsity patterns make it difficult to utilize cache locality effectively in SpMxV computations. In this work, we investigate single-and… (More)

- ‹
- 1
- ›