Skip navigation
  •  Home
  • UDC 
    • Getting started
    • RUC Policies
    • FAQ
    • FAQ on Copyright
    • More information at INFOguias UDC
  • Browse 
    • Communities
    • Browse by:
    • Issue Date
    • Author
    • Title
    • Subject
  • Help
    • español
    • Gallegan
    • English
  • Login
  •  English 
    • Español
    • Galego
    • English
  
View Item 
  •   DSpace Home
  • Facultade de Informática
  • Investigación (FIC)
  • View Item
  •   DSpace Home
  • Facultade de Informática
  • Investigación (FIC)
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

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

Thumbnail
View/Open
J.González_Dominguez_A_2D_Algorithm_with_Asymmetric_Workload_for_the_UPC_Conjugate_Gradient_Method_2014.pdf (588.0Kb)
Use this link to cite
http://hdl.handle.net/2183/20967
Collections
  • Investigación (FIC) [1687]
Metadata
Show full item record
Title
A 2D algorithm with asymmetric workload for the UPC conjugate gradient method
Author(s)
González-Domínguez, Jorge
Marques, Osni A.
Martín, María J.
Touriño, Juan
Date
2014
Citation
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
[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.
Keywords
Conjugate gradient
PGAS
UPC
Performance optimization
Data distribution
 
Description
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
Editor version
https://doi.org/10.1007/s11227-014-1300-0
ISSN
0920-8542
1573-0484
 

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsResearch GroupAcademic DegreeThis CollectionBy Issue DateAuthorsTitlesSubjectsResearch GroupAcademic Degree

My Account

LoginRegister

Statistics

View Usage Statistics
Sherpa
OpenArchives
OAIster
Scholar Google
UNIVERSIDADE DA CORUÑA. Servizo de Biblioteca.    DSpace Software Copyright © 2002-2013 Duraspace - Send Feedback