Difference between revisions of "OpenMP in Small Bites/Worksharing"
OpenMP in Small Bites/Worksharing
Jump to navigation
Jump to search
| Line 44: | Line 44: | ||
|type="()"} | |type="()"} | ||
+ Click and submit to see the answer | + Click and submit to see the answer | ||
| − | || <code> int i, int s = 0; <br /> for (i = 1; i < 100; i++){ <br /> s = a[i-1] + a[i]; <br /> } </code> <br /> No. Due to the depency between the loop iterations this would cause a data race | + | || <code> int i, int s = 0; <br /> for (i = 1; i < 100; i++){ <br /> s = a[i-1] + a[i]; <br /> } </code> <br /> (No. Due to the depency between the loop iterations this would cause a data race) |
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
</quiz> | </quiz> | ||
{{hidden end}} | {{hidden end}} | ||
Revision as of 18:35, 30 October 2020
| HPC.NRW | |
|---|---|
 | |
| Other HPC Courses | |
| 1. | Gprof Tutorial |
| 2. | Introduction to Linux in HPC |
| OpenMP in Small Bites | |
| 1. | Overview |
| 2. | Worksharing |
| 3. | Data Scoping |
| 4. | Non-Uniform Memory Access
|
Video
Quiz
Collapse
1. What is most commenly 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.