Extending OmpSs-2 with flexible task-based array reductions

View/Open
Cita com:
hdl:2117/129246
CovenanteeBarcelona Supercomputing Center
Document typeMaster thesis
Date2019-01-15
Rights accessOpen Access
All rights reserved. This work is protected by the corresponding intellectual and industrial
property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public
communication or transformation of this work are prohibited without permission of the copyright holder
Abstract
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.
SubjectsParallel programming (Computer science), Software engineering, Programació en paral·lel (Informàtica), Enginyeria de programari
DegreeMÀSTER UNIVERSITARI EN INNOVACIÓ I RECERCA EN INFORMÀTICA (Pla 2012)
Files | Description | Size | Format | View |
---|---|---|---|---|
137975.pdf | 2,158Mb | View/Open |