Introduction to Parallel Programming video lecture series – Part 09 “Implementing a Task Decomposition”

Introduction to Parallel Programming video lecture series – Part 09 “Implementing a Task Decomposition”

The lecture given here is the ninth part in the “Introduction to Parallel Programming” video series. This part describes how design and implement a task decomposition solution. An illustrative example for solving the 8 Queens problem is used. Multiple approaches are presented with the pros and cons for each described. After the approach is decided upon, code modifications using OpenMP are presented. Potential data race errors with a shared stack data structure holding board configurations (the tasks to be processed) are offered and a solution is found and implemented.

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. 

Running time: 24:43.

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.

Einzelheiten zur Compiler-Optimierung finden Sie in unserem Optimierungshinweis.