English   español  
Por favor, use este identificador para citar o enlazar a este item: http://hdl.handle.net/10261/139427
COMPARTIR / IMPACTO:
Estadísticas
logo share SHARE logo core CORE   Add this article to your Mendeley library MendeleyBASE

Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL
Exportar a otros formatos:
Título

Exploiting task and data parallelism in ILUPACK's preconditioned CG solver on NUMA architectures and many-core accelerators

AutorAliaga, Jose I.; Badia, Rosa M.; Barreda, Maria; Bollhöfer, Matthias; Dufrechou, Ernesto; Ezzatti, Pablo; Quintana-Orti, Enrique S.
Palabras claveSparse linear systems
Task and data parallelism
Reconditioned Conjugate Gradient solver
Multi-core processors
Intel Xeon Phi
Graphics processing units (GPUs)
Fecha de publicación2016
EditorElsevier
CitaciónParallel Computing 54: 97- 107 (2016)
ResumenWe present specialized implementations of the preconditioned iterative linear system solver in ILUPACK for Non-Uniform Memory Access (NUMA) platforms and many-core hardware co-processors based on the Intel Xeon Phi and graphics accelerators. For the conventional x86 architectures, our approach exploits task parallelism via the OmpSs runtime as well as a message-passing implementation based on MPI, respectively yielding a dynamic and static schedule of the work to the cores, with different numeric semantics to those of the sequential ILUPACK. For the graphics processor we exploit data parallelism by off-loading the computationally expensive kernels to the accelerator while keeping the numeric semantics of the sequential case.
URIhttp://hdl.handle.net/10261/139427
DOI10.1016/j.parco.2015.12.004
Identificadoresdoi: 10.1016/j.parco.2015.12.004
issn: 0167-8191
Aparece en las colecciones: (IIIA) Artículos
Ficheros en este ítem:
Fichero Descripción Tamaño Formato  
accesoRestringido.pdf15,38 kBAdobe PDFVista previa
Visualizar/Abrir
Mostrar el registro completo
 

Artículos relacionados:


NOTA: Los ítems de Digital.CSIC están protegidos por copyright, con todos los derechos reservados, a menos que se indique lo contrario.