Reduced-Bandwidth Multithreaded Algorithms for Sparse Matrix-Vector Multiplication

@article{Bulu2011ReducedBandwidthMA,
  title={Reduced-Bandwidth Multithreaded Algorithms for Sparse Matrix-Vector Multiplication},
  author={Aydin Buluç and Samuel Williams and Leonid Oliker and James Demmel},
  journal={2011 IEEE International Parallel & Distributed Processing Symposium},
  year={2011},
  pages={721-733}
}
On multicore architectures, the ratio of peak memory bandwidth to peak floating-point performance (byte:flop ratio) is decreasing as core counts increase, further limiting the performance of bandwidth limited applications. Multiplying a sparse matrix (as well as its transpose in the unsymmetric case) with a dense vector is the core of sparse iterative methods. In this paper, we present a new multithreaded algorithm for the symmetric case which potentially cuts the bandwidth requirements in half… CONTINUE READING
Highly Cited
This paper has 102 citations. REVIEW CITATIONS
65 Citations
44 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 65 extracted citations

103 Citations

0102030'12'14'16'18
Citations per Year
Semantic Scholar estimates that this publication has 103 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 44 references

Experimental performance of i/o-optimal sparse matrix dense vector multiplication algorithms within main memory

  • Riko Jacob, Michael Schnupp
  • In PARA, page extended abstract no
  • 2010
1 Excerpt

Goumas , and Nectarios Koziris . Optimizing sparse matrixvector multiplication using index and value compression

  • Kornilios Kourtis, I. Georgios
  • Conf . Computing Frontiers , pages
  • 2010

Similar Papers

Loading similar papers…