Shared memory parallelization with OpenMP

This course will be provided as ONLINE course (using Zoom).

The focus of this 2 days course is on shared memory parallelization with OpenMP for dual-core, multi-core, shared memory, and ccNUMA platforms. This course teaches OpenMP starting from a beginners level. Hands-on sessions (in C and Fortran) will allow users to immediately test and understand the OpenMP directives, environment variables, and library routines. Race-condition debugging tools are also presented.

This course is a PRACE training event. It is organized by the VSC Research Center, TU Wien, in cooperation with the High-Performance Computing-Center Stuttgart (HLRS). This course has been originally developed by Rolf Rabenseifner (HLRS).

 

Location

Online course
Organizer: VSC Research Center, TU Wien, Austria

Start date

Nov 10, 2022
08:45

End date

Nov 11, 2022
16:30

Language

English

Entry level

Basic

Course subject areas

Parallel Programming

Programming Languages for Scientific Computing

Topics

OpenMP

Back to list

Prerequisites and content levels

Prerequisites:
  • Familiarity with Linux and Linux editors is recommended.
  • Basics/principles of programming (in C, C++ or Fortran).
  • For doing the hands-on labs participants can choose between using their own laptops or any system they have access to that provides an OpenMP enabled compiler for their preferred programming language C/C++ or Fortran. Alternatively, participants can ask for a training user account at the VSC for the duration of the course.
Content levels:
  • Basic: 6 hours
  • Intermediate: 4 hours
  • Advanced: 2 hours

Learn more about course curricula and content levels.

 

Instructors

Lukas Einkemmer, Philipp Gschwandtner and Martina Prugger (University of Innsbruck)
Claudia Blaas-Schenner (VSC Research Center, TU Wien)
Moritz Siegel (tutor; VSC Research Center, TU Wien) 

Agenda

1st day

  • 08:45  Join online
  • 09:00    Welcome
  • 09:10    Introduction to modern hardware (talk)
  • 10:10    An overview of OpenMP (talk)
  • 10:35   Coffee
  • 10:50    OpenMP programming and execution model (talk+practical)
  • 12:30   Lunch
  • 13:30    OpenMP worksharing directives (talk+practical) 
  • 15:00   Coffee
  • 15:15    More OpenMP (talk+practical)
  • 16:00    Summary (talk) + Q & A
  • 16:30   End of first day

2nd day

  • 08:45  Join online
  • 09:00    How to write correct OpenMP programs (talk)
  • 09:30    Intel Inspector XE (demo+practical)
  • 10:30   Coffee
  • 10:45    How to write efficient OpenMP programs (talk)
  • 11:00    Heat equation (talk+practical)
  • 12:30   Lunch
  • 13:30    Heat equation (practical — continued)
  • 14:00    Vectorization with OpenMP (talk)
  • 14:25    Thread affinity in OpenMP (talk)
  • 15:00   Coffee
  • 15:15     The taskloop directive (talk+practical)
  • 16:30   End of second day (course)

Handout

A link to the course material (slides and exercises) will be available at course start

Registration Information

Please register via the PRACE registration page with your official e-mail address to prove your affiliation.

https://events.prace-ri.eu/event/1427/registrations/1061/

Registration period is from 16 August to 2 November 2022, and follows the "first come – first served" principle.
Additional registrations will be added to a waiting list.

Fee

This course is a PRACE Training Center (PTC) event. Therefore, the course is open and free of charge for participants from academia and industry from the Member States (MS) of the European Union (EU) and Associated/Other Countries to the Horizon 2020 programme.

Contact

Claudia Blaas-Schenner and Ulrike Faltin: training(at)vsc.ac.at

 

Further courses

See the training overview and the Supercomputing Academy pages.

https://vsc.ac.at/training (at the VSC Research Center, TU Wien)

Related training

All training

April 03 - 05, 2024

Online


April 16 - 19, 2024

Mainz, Germany


April 22 - 25, 2024

Online


May 06 - 07, 2024

Online


June 03 - 07, 2024

Hybrid Event - Stuttgart, Germany


October 14 - 18, 2024

Stuttgart, Germany