The lecture given here is the twelfth and final part in the “Introduction to Parallel Programming” video series. This part describes the pros and cons of static versus dynamic loop scheduling with an eye toward achieving a good load balance of work per thread. The different OpenMP schedule clauses, the overheads associated with each and the situations each one is best suited for are covered. Finally, in order to reduce the amount of thread interaction (barriers, synchronization, and other overheads), the efficacy of replicating work among threads is illustrated.
Two programming labs (Prime Counter and an iterative implementation of Quicksort) with instructions and source files are separately available for practice of information and ideas presented within the lecture video.
Running time: 9:42
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.