The lecture given here is the fourth part in the “Introduction to Parallel Programming” video series. This part provides the viewer with a description of the shared-memory model of parallel programming. Implementation strategies for domain decomposition and task decomposition problems using threads within a shared memory execution environment are illustrated. Simple code examples further support threaded implementations of parallel algorithms, especially with regards to deciding when variables should be shared and when variables must be made private to threads for correctness.
Running time: 14:50
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.