Recently, we have proposed a recursive partitioning based layout for multi-core computations on sparse matrices. Based on positive results of our initial experiments with matrix-vector multiplication, we discuss how this storage format can be utilized across a range of BLAS-style matrix operations
Abstract. We present a recursive way to partition hypergraphs which creates and exploits hypergraph ...
The problem of obtaining high computational throughput from sparse matrix multiple--vector multiplic...
Sparse computations are ubiquitous in computational codes, with the sparse matrix-vector (SpMV) mult...
Recently, we have proposed a recursive partitioning based layout for multi-core computations on spar...
In our earlier work, we have investigated the feasibility of utilization of recursive partitioning i...
Abstract—Recently, we have introduced an approach to basic sparse matrix computations on multicore c...
We discuss the interface design for the Sparse Basic Linear Algebra Subprograms (BLAS), the kernels ...
In this article, we introduce a cache-oblivious method for sparse matrix–vector multiplication. Our ...
In earlier work we have introduced the “Recursive Sparse Blocks ” (RSB) sparse matrix storage scheme...
The thesis introduces a cache-oblivious method for the sparse matrix-vector (SpMV) multiplication, w...
Sparse matrix computations arise in many scientific computing problems and for some (e.g.: iterative...
This paper describes a recursive method for the LU factorization of sparse matrices. The recursive f...
This paper describes a recursive method for the LU factorization of sparse matrices. The recursive f...
In this dissertation we have identified vector processing shortcomings related to the efficient stor...
A significant part of scientific codes consist of sparse matrix computations. In this work we propos...
Abstract. We present a recursive way to partition hypergraphs which creates and exploits hypergraph ...
The problem of obtaining high computational throughput from sparse matrix multiple--vector multiplic...
Sparse computations are ubiquitous in computational codes, with the sparse matrix-vector (SpMV) mult...
Recently, we have proposed a recursive partitioning based layout for multi-core computations on spar...
In our earlier work, we have investigated the feasibility of utilization of recursive partitioning i...
Abstract—Recently, we have introduced an approach to basic sparse matrix computations on multicore c...
We discuss the interface design for the Sparse Basic Linear Algebra Subprograms (BLAS), the kernels ...
In this article, we introduce a cache-oblivious method for sparse matrix–vector multiplication. Our ...
In earlier work we have introduced the “Recursive Sparse Blocks ” (RSB) sparse matrix storage scheme...
The thesis introduces a cache-oblivious method for the sparse matrix-vector (SpMV) multiplication, w...
Sparse matrix computations arise in many scientific computing problems and for some (e.g.: iterative...
This paper describes a recursive method for the LU factorization of sparse matrices. The recursive f...
This paper describes a recursive method for the LU factorization of sparse matrices. The recursive f...
In this dissertation we have identified vector processing shortcomings related to the efficient stor...
A significant part of scientific codes consist of sparse matrix computations. In this work we propos...
Abstract. We present a recursive way to partition hypergraphs which creates and exploits hypergraph ...
The problem of obtaining high computational throughput from sparse matrix multiple--vector multiplic...
Sparse computations are ubiquitous in computational codes, with the sparse matrix-vector (SpMV) mult...
DOI
Add to ORKG