We investigate a new storage format for unstructured sparse ma-trices, based on the space filling Hilbert curve. Numerical tests with matrix-vector multiplication show the potential of the fractal storage format (FS) in comparison to the traditional compressed row storage format (CRS). The FS format outperforms the CRS format by up to 50 % for matrix-vector multiplications with multiple right hand sides.
In this paper we investigate the execution of Ab and A^T b, where A is a sparse matrix and b a dense...
Abstract. A new format for storing sparse matrices is proposed for efficient sparse matrix-vector (S...
We improve the performance of sparse matrix-vector multiply (SpMV) on modern cache-based superscalar...
The sparse matrix–vector (SpMV) multiplication is an important kernel in many applications. When the...
The irregular nature of sparse matrix-vector multiplication, Ax = y, has led to the development of a...
The sparse matrix–vector (SpMV) multiplication is an important kernel in many applications. When the...
The irregular nature of sparse matrix-vector multiplication, Ax = y, has led to the development of a...
Sparse storage formats describe a way how sparse matrices are stored in a computer memory. Extensive...
Sparse storage formats describe a way how sparse matrices are stored in a computer memory. Extensive...
The handling of the sparse matrix vector product(SMVP) is a common kernel in many scientific applica...
The handling of the sparse matrix vector product(SMVP) is a common kernel in many scientific applica...
Abstract—Sparse matrix-vector multiplication (SpM×V) has been characterized as one of the most signi...
In this dissertation we have identified vector processing shortcomings related to the efficient stor...
Abstract. Many applications based on finite element and finite difference methods include the soluti...
An important kernel of scientific software is the multiplication of a sparse matrix by a vector. The...
In this paper we investigate the execution of Ab and A^T b, where A is a sparse matrix and b a dense...
Abstract. A new format for storing sparse matrices is proposed for efficient sparse matrix-vector (S...
We improve the performance of sparse matrix-vector multiply (SpMV) on modern cache-based superscalar...
The sparse matrix–vector (SpMV) multiplication is an important kernel in many applications. When the...
The irregular nature of sparse matrix-vector multiplication, Ax = y, has led to the development of a...
The sparse matrix–vector (SpMV) multiplication is an important kernel in many applications. When the...
The irregular nature of sparse matrix-vector multiplication, Ax = y, has led to the development of a...
Sparse storage formats describe a way how sparse matrices are stored in a computer memory. Extensive...
Sparse storage formats describe a way how sparse matrices are stored in a computer memory. Extensive...
The handling of the sparse matrix vector product(SMVP) is a common kernel in many scientific applica...
The handling of the sparse matrix vector product(SMVP) is a common kernel in many scientific applica...
Abstract—Sparse matrix-vector multiplication (SpM×V) has been characterized as one of the most signi...
In this dissertation we have identified vector processing shortcomings related to the efficient stor...
Abstract. Many applications based on finite element and finite difference methods include the soluti...
An important kernel of scientific software is the multiplication of a sparse matrix by a vector. The...
In this paper we investigate the execution of Ab and A^T b, where A is a sparse matrix and b a dense...
Abstract. A new format for storing sparse matrices is proposed for efficient sparse matrix-vector (S...
We improve the performance of sparse matrix-vector multiply (SpMV) on modern cache-based superscalar...