Caching-Efficient Multithreaded Fast Multiplication of Sparse Matrices

13 years 8 months ago

Download ipdps.cc.gatech.edu

Several fast sequential algorithms have been proposed in the past to multiply sparse matrices. These algorithms do not explicitlyaddresstheimpactofcachingonperformance. We show that a rather simple sequential cache

Peter Sulatycke, Kanad Ghose

Real-time Traffic

Algorithm | Distributed And Parallel Computing | Fast Sequential Algorithms | IPPS 1998 | Sparse Matrices |

claim paper

» Fast Sparse Matrix Multiplication

» Fast Sparse MatrixVector Multiplication on GPUs Implications for Graph Mining

» Fast Sparse MatrixVector Multiplication by Exploiting Variable Block Structure

» Fast Conjugate Gradients with Multiple GPUs

» On parallel block algorithms for exact triangularizations

» Parametric model order reduction accelerated by subspace recycling

» Adaptive Wavelet Methods II Beyond the Elliptic Case

Post Info
More Details (n/a)

Added	05 Aug 2010
Updated	05 Aug 2010
Type	Conference
Year	1998
Where	IPPS
Authors	Peter Sulatycke, Kanad Ghose

Comments (0)

Sciweavers

Caching-Efficient Multithreaded Fast Multiplication of Sparse Matrices

Algorithm | Distributed And Parallel Computing | Fast Sequential Algorithms | IPPS 1998 | Sparse Matrices |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers