Parallel Programming WS 2014/2015 - Slide 49
Objectives:
Data parallelism not only for arrays!
In the lecture:
Explain
- parallel scanning of lists,
- doubling distances for lists,
- last[last[i]],
- that it is only useful if the ends of many long lists are searched.
Questions:
- Which role plays the distance d here?
Generiert mit Camelot | Probleme mit Camelot? | Geändert am: 09.10.2014