OpenMP parallelism in scientific computing
- Abstract:
The purpose of the course is to learn when a code could benefit from OpenMP, including task-based parallelism, and how to apply it. A task-based algorithm comprises of a set of self-contained tasks that have well-defined inputs and outputs. This differs from the common practice of organizing an implementation into subroutines in that a task-based implementation does not call the associated computation kernels directly, instead it is the role of a runtime system to schedule the task to various computational resources, such as CPU cores and GPUs. One of the main benefits of this approach is that the underlying parallelism is exposed automatically as the runtime system gradually traverses the resulting task graph.
- Content:
The course mainly focuses on the task-pragmas implemented in the newer incarnations of OpenMP.
- Format:
Onsite course.
- Audience:
…
- Date and Time:
Nov.-Dec. 2025, 13:00-15:00
- Location:
On-site
- Instructors:
Pedro Ojeda-May (pedro.ojeda-may@umu.se)
- Recordings:
…
- Registration:
…
- Acknowledgment:
This material is based on the courses created by Joachim Hein (Lund University) and Mirko Myllykoski (Umeå University).
Prerequisites
Basic knowledge of C programming language.
Basic knowledge of parallel programming.
Basic Linux skills.
Basic knowledge of OpenMP is beneficial but not required.
Day 4
Miscellanous