Hybrid-Parallel Sparse Matrix–Vector Multiplication and Iterative Linear Solvers with the Communication Library GPI

Authors: ,

Abstract: We present a library of Krylov subspace iterative solvers built over the PGAS-type communication layer GPI. The hybrid pattern is here the appropriate choice to reveal the hierarchical parallelism of clusters with multiand many- core nodes. Our approach includes asynchronous communication and differs in many aspects from the classical one. We first present the GPI-based implementation of the sparse matrix-vector multiplication and then, using as a benchmark the numerical solution of a Poisson boundary value problem in a unit cube, we compare the performance on Intel/Infiniband and CRAY XE6 architectures of our GPI-based Conjugate Gradients and Richardson methods against the ones available in PETSc. The results show good scalability and performance of our approach, at least comparable to these of PETSc.

WSEAS Transactions on Information Science and Applications, ISSN / E-ISSN: 1790-0832 / 2224-3402, Volume 11, 2014, Art. #17

PDF
XML
Cite
×
Citation Tools
WSEAS AMA
Dimitar Stoyanov, Franz-Josef Pfreundt, "Hybrid-Parallel Sparse Matrix–Vector Multiplication and Iterative Linear Solvers with the Communication Library GPI," WSEAS Transactions on Information Science and Applications, vol. 11, pp. 160-168, 2014, DOI:
Dimitar Stoyanov, Franz-Josef Pfreundt. Hybrid-Parallel Sparse Matrix–Vector Multiplication and Iterative Linear Solvers with the Communication Library GPI. WSEAS Transactions on Information Science and Applications. 2014;11:160-168.
Copy to Clipboard
Citation copied to Clipboard

Certification

---