Illinois ECE 498AL: Programming Massively Parallel Processors, Lecture 12: Structuring Parallel Algorithms
Recommendations
- Illinois ECE 498AL: Programming Massively Parallel Processors, Lecture 1: Introduction
- Illinois ECE 498AL: Programming Massively Parallel Processors, Lecture 10: Control Flow
- Illinois ECE 498AL: Programming Massively Parallel Processors, Lecture 2: The CUDA Programming Model
- Illinois ECE 498AL: Programming Massively Parallel Processors, Lecture 6: CUDA Memories - Part 2
- Illinois ECE 498AL: Programming Massively Parallel Processors, Lecture 5: CUDA Memories
- Illinois ECE 498AL: Programming Massively Parallel Processors, Lecture 4: CUDA Threads - Part 2
- Illinois ECE 498AL: Programming Massively Parallel Processors, Lecture 3: CUDA Threads, Tools, Simple Examples
Category
Published on
Abstract
Structuring Parallel Algorithms
Topics:
- Key Parallel Programming Steps
- Algorithms
- 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"
Credits
These lecture were breezed by Carl Pearson and Daniel Borup and then reviewed, edited ,and Uploaded by Omar Sobh.
Sponsored by
NCN@illinois
Cite this work
Researchers should cite this work as follows:
-
Wen-Mei W Hwu (2009), "Illinois ECE 498AL: Programming Massively Parallel Processors, Lecture 12: Structuring Parallel Algorithms," https://nanohub.org/resources/7372.