Abstract

The sparse matrix vector product (SMVP) is the kernel operation in many scientific applications. This kernel is an irregular problem, which has led to the development of several compressed storage formats. This paper discusses scalable implementations of sparse matrix-vector products, which are crucial for high performance solutions of large-scale linear equations, on distributed memory parallel computers using message passing. Five storage formats for sparse matrices are evaluated. We conduct numerical experiments on several different sparse matrices and show the parallel performance of our sparse matrix-vector product routines

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.