9 search results - page 1 / 2 » Caching-Efficient Multithreaded Fast Multiplication of Spars... |
IPPS
1998
IEEE
13 years 9 months ago
1998
IEEE
Several fast sequential algorithms have been proposed in the past to multiply sparse matrices. These algorithms do not explicitlyaddresstheimpactofcachingonperformance. We show th...
ICPP
2008
IEEE
13 years 11 months ago
2008
IEEE
Abstract—The Sparse Matrix-Vector Multiplication kernel exhibits limited potential for taking advantage of modern shared memory architectures due to its large memory bandwidth re...
ESA
2004
Springer
13 years 10 months ago
2004
Springer
Let A and B two n × n matrices over a ring R (e.g., the reals or the integers) each containing at most m non-zero elements. We present a new algorithm that multiplies A and B usi...
CORR
2011
Springer
12 years 12 months ago
2011
Springer
Scaling up the sparse matrix-vector multiplication kernel on modern Graphics Processing Units (GPU) has been at the heart of numerous studies in both academia and industry. In thi...
HPCC
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. We improve the performance of sparse matrix-vector multiplication (SpMV) on modern cache-based superscalar machines when the matrix structure consists of multiple, irregu...