Extending OmpSs-2 with flexible task-based array reductions
Reductions are a well-known computational pattern found in scientific applications that needs efficient parallelisation mechanisms. In this thesis we present a flexible scheme for computing reductions of arrays in the context of OmpSs-2, a task-based programming model similar to OpenMP.
| Autor: | |
|---|---|
| Tipo de recurso: | tesis de maestría |
| Fecha de publicación: | 2019 |
| País: | España |
| Institución: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/129246 |
| Acceso en línea: | https://hdl.handle.net/2117/129246 |
| Access Level: | acceso abierto |
| Palabra clave: | Parallel programming (Computer science) Software engineering HPC OpenMP OmpSs OmpSs-2 Mercurium Nanos6 tasca reduccions array compilador runtime model programació task reductions compiler programming Programació en paral·lel (Informàtica) Enginyeria de programari Àrees temàtiques de la UPC::Informàtica |
| Sumario: | Reductions are a well-known computational pattern found in scientific applications that needs efficient parallelisation mechanisms. In this thesis we present a flexible scheme for computing reductions of arrays in the context of OmpSs-2, a task-based programming model similar to OpenMP. |
|---|