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

• Type: Conference
• Year: 1998
• Where: IPPS
• Authors: Peter Sulatycke, Kanad Ghose
• Keywords: Algorithm, Distributed And Parallel Computing, Fast Sequential Algorithms, IPPS 1998, Sparse Matrices