| |
Module 4: Parallel Programming: Shared Memory and Message Passing |
| |
Lecture 7: Examples of Shared Memory and Message Passing Programming |
| |
Major Changes
Message Passing
- This algorithm is deterministic
- May converge to a different solution compared to the shared memory version if there are multiple solutions: why?
- There is a fixed specific point in the program (at the beginning of each iteration) when the neighboring rows are communicated
- This is not true for shared memory
|
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
|
|
|
|
