In this paper, we present our research in this direction, extending the one-dimensional method for cache-oblivious SpMV multiplication to two dimensions.

Oct 10, 2010 · Abstract. In earlier work, we presented a one-dimensional cache-oblivious sparse matrix–vector. (SpMV) multiplication scheme which has its ...

Yzelman and Bisseling, Two-dimensional cache-oblivious sparse matrix–vector multiplication, April 2011 (Revised pre-print); http://www.math.uu.nl/people/yzelman ...

Abstract. In this article, we introduce a cache-oblivious method for sparse matrix vector multiplication. Our method attempts to permute the rows and ...

Oct 10, 2010 · In this paper, we present our re- search in this direction, extending the one-dimensional method for cache-oblivious SpMV multiplication to two ...

Cache-Oblivious Sparse Matrix-Vector Multiplication by Using Sparse Matrix Partitioning Methods · A Two-Dimensional Data Distribution Method for Parallel Sparse ...

Oct 22, 2024 · In this article, we introduce a cache-oblivious method for sparse matrix-vector multiplication. Our method attempts to permute the rows and ...

A cache-oblivious method to permute the rows and columns of the input matrix using a recursive hypergraph-based sparse matrix partitioning scheme so that ...

A new method is presented for distributing data in sparse matrix-vector multiplication. The method is two-dimensional, tries to minimize the true communication ...

Gains can be as large as 50 percent for the 1D method and 63 percent for the 2D method. What we consider in this paper is a change of datastructure instead of ...