Structuring Parallel Algorithms
- Key Parallel Programming Steps
- Choosing Algorithm Structure
- Mapping a Divide and Conquer algorithm
- Tiled Algorithms
- Increased work per thread
- Double Buffering
- Loop Fusion and Memory Privatization
- Pipeline or "Spatial Computing Model"
These lecture were breezed by Carl Pearson and Daniel Borup and then reviewed, edited ,and Uploaded by Omar Sobh.
Cite this work
Researchers should cite this work as follows: