A work-efficient parallel sparse matrix-sparse vector multiplication algorithm
Published in arXiv (Cornell University) • Oct 25, 2016
NobleIDNI1P45W11R98S71
Authors:,
Ariful Azad
Aydın Buluç
Abstract
We design and develop a work-efficient multithreaded algorithm for sparse matrix-sparse vector multiplication (SpMSpV) where the matrix, the input vector, and the output vector are all sparse. SpMSpV is an important primitive in the emerging GraphBLAS standard and is the workhorse of many graph algo...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!