Iteration-fusing conjugate gradient for sparse linear systems with MPI + OmpSs
Rights accessRestricted access - publisher's policy (embargoed until 2020-12-19)
In this paper, we target the parallel solution of sparse linear systems via iterative Krylov subspace-based method enhanced with a block-Jacobi preconditioner on a cluster of multicore processors. In order to tackle large-scale problems, we develop task-parallel implementations of the preconditioned conjugate gradient method that improve the interoperability between the message-passing interface and OmpSs programming models. Specifically, we progressively integrate several communication-reduction and iteration-fusing strategies into the initial code, obtaining more efficient versions of the method. For all these implementations, we analyze the communication patterns and perform a comparative analysis of their performance and scalability on a cluster consisting of 32 nodes with 24 cores each. The experimental analysis shows that the techniques described in the paper outperform the classical method by a margin that varies between 6 and 48%, depending on the evaluation.
CitationBarreda, M. [et al.]. Iteration-fusing conjugate gradient for sparse linear systems with MPI + OmpSs. "The Journal of Supercomputing", 2020, vol. 76, p. 6669-6689.