Sciweavers

IPPS
1998
IEEE

Caching-Efficient Multithreaded Fast Multiplication of Sparse Matrices

14 years 3 months ago
Caching-Efficient Multithreaded Fast Multiplication of Sparse Matrices
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
Added 05 Aug 2010
Updated 05 Aug 2010
Type Conference
Year 1998
Where IPPS
Authors Peter Sulatycke, Kanad Ghose
Comments (0)