This three-seminar series will help you understand the basics of parallel computing and will present two common frameworks for writing parallelized code. RSVP is recommended but not required.
Introduction to Parallel Computing
This new seminar will provide a brief overview of the extensive and broad topic of parallel computing, as a lead-in for the future seminars. It covers the basics of parallel computing - what it is and how it's used, followed by discussions on terminology associated with parallel computing, parallel memory architectures, and programming models. The session also explores the considerations related to designing and running parallel programs, with some considerations of doing so on high-end compute systems. This seminar is open for persons at all skill levels, but basic unix and programming skills are assumed.
Upcoming Classes:
No classes scheduled at this time
Seminar Materials
Intro to Parallel Computing slide deck
Parallelizing Code with OpenMP
OpenMP provides a portable, scalable model for developers of shared memory parallel applications. It supports C/C++ and Fortran on a wide variety of architectures. This session provides an introduction to OpenMP, including its various constructs and directives for specifying parallel regions, work sharing, synchronization and data environment, and how to effectively use this on the cluster. Basic unix and programming skills are assumed, and attendance at the Introduction to Parallel Computing seminar strongly encouraged.
No classes scheduled at this time
Seminar Materials
Parallel Computing with OpenMP slide deck
Parallelizing Code with MPI
This session provides an introduction to the Message Passing Interface (MPI) and how to develop and run simple parallel programs according to the MPI standard. It covers topics such as MPI Environment Management, Point-to-Point, and Collective Communication. It also discusses the considerations for efficient parallelization with MPI. Illustrative examples in both C++ and Fortran are provided.
No classes scheduled at this time
Last updated: February 3, 2020 at 11:20 am