A 2D algorithm with asymmetric workload for the UPC conjugate gradient method

Use este enlace para citar
http://hdl.handle.net/2183/20967Coleccións
- Investigación (FIC) [1615]
Metadatos
Mostrar o rexistro completo do ítemTítulo
A 2D algorithm with asymmetric workload for the UPC conjugate gradient methodData
2014Cita bibliográfica
González-Domínguez, J., Marques, O.A., Martín, M.J. et al. J Supercomput (2014) 70: 816. https://doi.org/10.1007/s11227-014-1300-0
Resumo
[Abstract] This paper examines four different strategies, each one with its own data distribution, for implementing the parallel conjugate gradient (CG) method and how they impact communication and overall performance. Firstly, typical 1D and 2D distributions of the matrix involved in CG computations are considered. Then, a new 2D version of the CG method with asymmetric workload, based on leaving some threads idle during part of the computation to reduce communication, is proposed. The four strategies are independent of sparse storage schemes and are implemented using Unified Parallel C (UPC), a Partitioned Global Address Space (PGAS) language. The strategies are evaluated on two different platforms through a set of matrices that exhibit distinct sparse patterns, demonstrating that our asymmetric proposal outperforms the others except for one matrix on one platform.
Palabras chave
Conjugate gradient
PGAS
UPC
Performance optimization
Data distribution
PGAS
UPC
Performance optimization
Data distribution
Descrición
This is a post-peer-review, pre-copyedit version of an article published in Journal of Supercomputing. The final authenticated version is available online at: https://doi.org/10.1007/s11227-014-1300-0
Versión do editor
ISSN
0920-8542
1573-0484
1573-0484