Difference between revisions of "OpenMP in Small Bites/Worksharing"
OpenMP in Small Bites/Worksharing
Jump to navigation
Jump to search
m (Use new syllabus template) |
|||
| Line 1: | Line 1: | ||
[[Category:Tutorials]] | [[Category:Tutorials]] | ||
| − | + | {{Syllabus OpenMP in Small Bites}} | |
__TOC__ | __TOC__ | ||
| − | |||
| − | |||
Revision as of 11:23, 18 November 2020
| Tutorial | |
|---|---|
| Title: | OpenMP in Small Bites |
| Provider: | HPC.NRW
|
| Contact: | tutorials@hpc.nrw |
| Type: | Multi-part video |
| Topic Area: | Programming Paradigms |
| License: | CC-BY-SA |
| Syllabus
| |
| 1. Overview | |
| 2. Worksharing | |
| 3. Data Scoping | |
| 4. False Sharing | |
| 5. Tasking | |
| 6. Tasking and Data Scoping | |
| 7. Tasking and Synchronization | |
| 8. Loops and Tasks | |
| 9. Tasking Example: Sudoku Solver | |
| 10. Task Scheduling | |
| 11. Non-Uniform Memory Access | |
Video
Quiz
Collapse
1. What is most commonly used worksharing construct in OpenMP to distribute work among loop interations?
Collapse
3. Can the following code snipped be parallelized with the OpenMP for-construct with out breaking the semantic? Justify your answer.
int i, int s = 0;
for (i = 1; i < 100; i++){ s = a[i-1] + a[i]; }