© 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.This work has been developed with the support of the grant SEV-2011-00067 of Severo Ochoa P...
OmpSs is a task-based programming model that aims to provide portability and flexibility for sequent...
© 2017 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for a...
OpenMP has been very successful in exploiting structured parallelism in applications. With increasin...
The wide adoption of parallel processing hardware in mainstream computing as well as the raising int...
Wide adoption of parallel processing hardware in mainstream computing as well as the interest for ef...
Reductions represent a common algorithmic pattern in many scientific applications. OpenMP* has alway...
Reductions are a well-known computational pattern found in scientific applications that needs effici...
Traditional parallel applications have exploited regular parallelism, based on parallel loops. Only ...
OpenMP is a parallel programming model widely used on shared-memory systems. Over the years, the Ope...
Task-based parallel programming models based on compiler directives have proved their effectiveness ...
This paper presents a novel proposal to define task parallelism in OpenMP. Task parallelism has been...
Abstract—OpenMP has been very successful in exploiting structured parallelism in applications. With ...
Parallel task-based programming models like OpenMP support the declaration of task data dependences....
Abstract. This paper presents a novel proposal to define task paral-lelism in OpenMP. Task paralleli...
Abstract- Twenty-first century parallel programming models are becoming real complex due to the dive...
OmpSs is a task-based programming model that aims to provide portability and flexibility for sequent...
© 2017 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for a...
OpenMP has been very successful in exploiting structured parallelism in applications. With increasin...
The wide adoption of parallel processing hardware in mainstream computing as well as the raising int...
Wide adoption of parallel processing hardware in mainstream computing as well as the interest for ef...
Reductions represent a common algorithmic pattern in many scientific applications. OpenMP* has alway...
Reductions are a well-known computational pattern found in scientific applications that needs effici...
Traditional parallel applications have exploited regular parallelism, based on parallel loops. Only ...
OpenMP is a parallel programming model widely used on shared-memory systems. Over the years, the Ope...
Task-based parallel programming models based on compiler directives have proved their effectiveness ...
This paper presents a novel proposal to define task parallelism in OpenMP. Task parallelism has been...
Abstract—OpenMP has been very successful in exploiting structured parallelism in applications. With ...
Parallel task-based programming models like OpenMP support the declaration of task data dependences....
Abstract. This paper presents a novel proposal to define task paral-lelism in OpenMP. Task paralleli...
Abstract- Twenty-first century parallel programming models are becoming real complex due to the dive...
OmpSs is a task-based programming model that aims to provide portability and flexibility for sequent...
© 2017 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for a...
OpenMP has been very successful in exploiting structured parallelism in applications. With increasin...