17 search results - page 1 / 4 » Highly Parallel Sparse Matrix-Matrix Multiplication |
CORR
2010
Springer
14 years 5 months ago
2010
Springer
ICPP
2008
IEEE
15 years 1 days 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...
IAJIT
2011
14 years 17 days ago
2011
: The present paper discusses the implementations of sparse matrix-vector products, which are crucial for high performance solutions of large-scale linear equations, on a PC-Cluste...
EUROPAR
2003
Springer
14 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...
ISSAC
2009
Springer
15 years 4 days ago
2009
Springer
We present a high performance algorithm for multiplying sparse distributed polynomials using a multicore processor. Each core uses a heap of pointers to multiply parts of the poly...