Introduction to Parallel Programming video lecture series – Part 08 “OpenMP for Task Decomposition”

Introduction to Parallel Programming video lecture series – Part 08 “OpenMP for Task Decomposition”

The lecture given here is the eighth part in the “Introduction to Parallel Programming” video series. This part describes how the OpenMP task pragma works and how it is different from the previous worksharing pragmas. A small linked list processing code example is used to illustrate how independent operation within a while-loop can be parallelized.  Since recursive functions, where the recursive calls are independent, can be executed in parallel, the OpenMP task construct is used to parallelize the computation of a desired member from the Fibonacci sequence.

A programming lab (recursive implementation of Quicksort) with instructions and source files are separately available for practice of information and ideas presented within the lecture video. While everything needed to succeed is presented within this lecture, it is recommended that Part 09, “Implementing a Task Decomposition,” be viewed before attempting this exercise.

Running time: 19:04.

Note: The material presented in this lecture series has been taken from the Intel Software College multi-day seminar, “Introduction to Parallel Programming”, authored by Michael J. Quinn (Seattle University). The content has been reorganized and updated for the lectures in this series.

Para obter mais informações sobre otimizações de compiladores, consulte Aviso sobre otimizações.