#### Filter Results:

- Full text PDF available (7)

#### Publication Year

2011

2017

- This year (2)
- Last 5 years (9)
- Last 10 years (10)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Data Set Used

#### Key Phrases

Learn More

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

For outer-product–parallel sparse matrix-matrix multiplication (SpGEMM) of the form C=A×B, we propose three hypergraph models that achieve simultaneous partitioning of input and output matrices without any replication of input data. All three hypergraph models perform conformable one-dimensional (1D) columnwise and 1D rowwise partitioning of the input… (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 singleand… (More)

- 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 singleand… (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)

- Kadir Akbudak, Cevdet Aykanat
- IEEE Transactions on Parallel and Distributed…
- 2017

Exploiting spatial and temporal localities is investigated for efficient row-by-row parallelization of general sparse matrix-matrix multiplication (SpGEMM) operation of the form <inline-formula><tex-math notation="LaTeX">$C=A\,B$ </tex-math><alternatives><inline-graphic xlink:href="aykanat-ieq1-2656893.gif"/></alternatives></inline-formula> on many-core… (More)

- 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 singleand… (More)

- R. Oguz Selvitopi, Kadir Akbudak, Cevdet Aykanat
- Resource Management for Big Data Platforms
- 2016

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 singleand… (More)

- ‹
- 1
- ›