Abstract

A new multicoloring technique is proposed for parallel sparse matrix-vector multiplication, which dominates the computing cost of iterative PDE (partial differential equation) solvers. The new technique enables parallel solution of grid-structured nonsymmetric PDE problems on shared-memory multiprocessors through resolving memory access conflicts by multiple processors. The coloring scheme is formulated as an algebraic mapping which can be implemented with low overhead.

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.