19 search results - page 1 / 4 » Challenges and Advances in Parallel Sparse Matrix-Matrix Mul... |
ICPP
2008
IEEE
13 years 11 months ago
2008
IEEE
We identify the challenges that are special to parallel sparse matrix-matrix multiplication (PSpGEMM). We show that sparse algorithms are not as scalable as their dense counterpar...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
IPPS
2007
IEEE
13 years 11 months ago
2007
IEEE
Multi-core processors are a shift of paradigm in computer architecture that promises a dramatic increase in performance. But multi-core processors also bring an unprecedented leve...
EUROPAR
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. This paper shows how a sparse hypermatrix Cholesky factorization can be improved. This is accomplished by means of efficient codes which operate on very small dense matri...
ICPP
2009
IEEE
13 years 11 months ago
2009
IEEE
—Sparse Matrix-Vector multiplication (SpMV) is a very challenging computational kernel, since its performance depends greatly on both the input matrix and the underlying architec...