In this paper, we aim at exploiting the power computing of a graphics processing unit (GPU) cluster for solving large sparse linear systems. We implement the parallel algorithm of the generalized minimal residual iterative method using the Compute Unified Device Architecture programming language and the MPI parallel environment. The experiments show that a GPU cluster is more efficient than a CPU cluster. In order to optimize the performances, we use a compressed storage format for the sparse vectors and the hypergraph partitioning. These solutions improve the spatial and temporal localization of the shared data between the computing nodes of the GPU cluster. © 2014 Springer Science+Business Media New York.
CITATION STYLE
Ziane Khodja, L., Couturier, R., Giersch, A., & Bahi, J. M. (2014). Parallel sparse linear solver with GMRES method using minimization techniques of communications for GPU clusters. Journal of Supercomputing, 69(1), 200–224. https://doi.org/10.1007/s11227-014-1143-8
Mendeley helps you to discover research relevant for your work.