Illinois ECE 498AL: Programming Massively Parallel Processors, Lecture 12: Structuring Parallel Algorithms

By Wen-Mei W Hwu

University of Illinois at Urbana-Champaign

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," http://nanohub.org/resources/7372.

    BibTex | EndNote

Tags