Parallel Programming WS 2014/2015 - Slide 46
Objectives:
Understand the dissemination barrier
In the lecture:
- Symmetric code for arbitrary many processes.
- Arc i to j in the diagram means j waits for arrival of i.
- show the synchronization for pairs.
- No cyclic waiting, because the arrival is indicated first, then the partner is waited for.
- After the last round all processes are synchronized, because for all processes p a binary tree exists s.t. p is its root, all processes are in that tree, the arcs are waiting pairs from the diagram forming pathes from the leaves to the root..
Questions:
- Write the synchronization code.
- Show one of the binary trees.
Generiert mit Camelot | Probleme mit Camelot? | Geändert am: 09.10.2014