False Sharing (OpenMP)
OpenMP in Small Bites/False Sharing /
Jump to navigation
Jump to search
Revision as of 16:28, 4 December 2020 by Marc-andre-hermanns-bc32@rwth-aachen.de (talk | contribs) (Tweak page sorting and title)
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 |
This video explains the concept of caches in parallel computer architectures, discusses the problem of false sharing, shows how it influences the performance of OpenMP programs and how to avoid it. Further hardware-specific topics which influence the way to develop scalable OpenMP programs is discussed in the part about Non-Uniform Memory Access.
Video
Quiz
1. What causes the introduction of caches in parallel architectures?
2. Why is false sharing a problem in OpenMP programs?
3. What might cause a false sharing effect?