A 2D algorithm with asymmetric workload for the UPC conjugate gradient method
Use this link to citehttp://hdl.handle.net/2183/20967
- GI-GAC - Artigos 
MetadataShow full item record
TitleA 2D algorithm with asymmetric workload for the UPC conjugate gradient method
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
[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.
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