Introduction to Parallel Programming video lecture series – Part 02 “Parallel Decomposition Methods”

The lecture given here is the second part in the “Introduction to Parallel Programming” video series. This part endeavors to give the viewer strategies that can identify opportunities for parallelism in code segments and applications. Three methods for dividing computation into independent work (Domain Decomposition, Task Decomposition, and Pipelining) are illustrated. The first two methods will be examined in later parts of the series and lab exercises.

Running time: 8:47

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.

There are downloads available under the Creative Commons License license. Download Now

Include in RSS: 

For more complete information about compiler optimizations, see our Optimization Notice.