The focus is on the programming models MPI and OpenMP. Hands-on sessions (in C, Fortran and Python) will allow users to immediately test and understand the basic constructs of the Message Passing Interface (MPI) and the shared memory directives of OpenMP (in C and Fortran). This course provides scientific training in Computational Science, and in addition, the scientific exchange of the participants among themselves. This course is organized by the University of Mainz in cooperation with HLRS.
Zentrum für Datenverarbeitung (ZDV) Johannes Gutenberg-Universität Mainz Anselm-Franz-von-Bentzel-Weg 12 Room N33 55128 Mainz, Germany
16. Apr 2024 08:30
19. Apr 2024 18:00
Mainz, Germany
Englisch
Basis
Paralleles Programmieren
MPI
OpenMP
Zurück zur Liste
Unix, C or Fortran
Learn more about course curricula and content levels.
Dr. Rolf Rabenseifner (Stuttgart, member of the MPI-2/3/4 forum).
The preliminary course outline can be found here (PDF download).
Each participant will get a pdf of all slides. The MPI-1 part of the course is based on the MPI course developed by the EPCC Training and Education Centre, Edinburgh Parallel Computing Centre. If you want, you may also buy copies of the standards MPI-3.1 (Hardcover, 7 Euro). An older version of this course with most of the material (including the audio information) can also be viewed in the ONLINE Parallel Programming Workshop.
Register via the button at the top of this page. We encourage you to register to the waiting list if the course is full. Places might become available.
Dr. Christian Meesters hpc(at)uni-mainz.de (Zentrum für Datenverarbeitung)
https://www.hlrs.de/training/2024/par-mainz and the website at ZDV Mainz https://converia.uni-mainz.de/frontend/index.php?sub=163
See the training overview and the Supercomputing Academy pages.
November 04 - Dezember 06, 2024
Online (flexible)
Dezember 02 - 05, 2024
Online by JSC
Januar 13 - 31, 2025
Hybrid Event - Stuttgart, Germany
Januar 21 - 23, 2025
Februar 17 - 21, 2025
Stuttgart, Germany
März 17 - 21, 2025
Dresden, Germany