English   español  
Por favor, use este identificador para citar o enlazar a este item: http://hdl.handle.net/10261/132339
Compartir / Impacto:
Estadísticas
Add this article to your Mendeley library MendeleyBASE
Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL
Título

Task-parallel reductions in openMP and OmpSs

AutorCiesko, Jan; Mateo, Sergi; Teruel, Xavier; Beltran, Vicenç; Martorell, Xavier; Badia, Rosa M.; Ayguade, Eduard; Labarta, Jesus
Palabras claveParallel programming
Recursive algorithms
Task
OmpSs
Reduction
Recursion
OpenMP
Fecha de publicación2014
EditorSpringer
CitaciónLecture Notes in Computer Science, vol.8766. Using and Improving OpenMP for Devices, Tasks, and More: 10th International Wprkshop on OpenMP, IWOMP 2014 Salvador, Brazil, September 28-30, 2014. Proceedings. pp. 1-15
Resumen© Springer International Publishing Switzerland 2014. The wide adoption of parallel processing hardware in mainstream computing as well as the raising interest for efficient parallel programming in the developer community increase the demand for parallel programming model support for common algorithmic patterns. In this work we present an extension to the OpenMP task construct to add support for reductions in while-loops and general-recursive algorithms. Further we discuss implications on the OpenMP standard and present a prototype implementation in OmpSs. Benchmark results confirm applicability of this approach and scalability on current SMP systems.
URIhttp://hdl.handle.net/10261/132339
DOI10.1007/978-3-319-11454-5_1
Identificadoresdoi: 10.1007/978-3-319-11454-5_1
issn: 1611-3349
isbn: 978-3-319-11453-8
Aparece en las colecciones: (IIIA) Comunicaciones congresos
Ficheros en este ítem:
Fichero Descripción Tamaño Formato  
accesoRestringido.pdf15,38 kBAdobe PDFVista previa
Visualizar/Abrir
Mostrar el registro completo
 


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