May 10 – 12, 2021
Europe/Budapest timezone

The purpose of this online course is to learn when a code could benefit from 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.

The course will be given online, over Zoom. The course will be three half-days.

More information, schedule, and registration can be found on the course webpage at HPC2N, Umeå University.

HPC2N, Umeå University MIT-building Campustorget 5, 4th S-907 36 Umeå Sweden
  • Basic knowledge of the C programming language.
  • Basic knowledge of parallel programming.
  • Basic Linux skills.
  • Basic knowledge of OpenMP is beneficial but not required.
Language: English
Instructors: Dr. Mirko Myllykoski (HPC2N/CS), Dr. Pedro Ojeda-May (HPC2N), Birgitte Brydsö (HPC2N)
Registration: Registration on the course website at HPC2N. Registration ends 1 May 2021, and follows the "first come – first served" principle. For the online course we can take a maximum of 50 persons. Additional registrations will be added to a waiting list.
Fee: This course is a PRACE Training Center (PTC) event. Therefore, the course is free of charge for all participants from the EU or from PRACE-member countries.