Friday morning October 31, nanoHUB tools and home directories will be unavailable from 6 AM to noon (eastern time); we're getting a new file server! All tool sessions will be lost. Also, the web site will be unavailable for about 15 minutes sometime between 8-9 AM. close

Support

Support Options

Submit a Support Ticket

 

Illinois ECE 498AL: Programming Massively Parallel Processors, Lecture 13: Reductions and their Implementation

By Wen-Mei W Hwu

University of Illinois at Urbana-Champaign

Published on

Abstract

Structuring Parallel Algorithms

Topics:

  • Parallel Reductions
  • Parallel Prefix Sum
  • Relevance of Scan
  • Application of Scan
  • Scan on the CPU
  • First attempt Parallel Scan Algorithm
  • Work efficiency considerations
  • Improving Efficiency
  • Use Padding to reduce conflicts
  • Global Synchronization in CUDA

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 13: Reductions and their Implementation," http://nanohub.org/resources/7376.

    BibTex | EndNote

Tags

nanoHUB.org, a resource for nanoscience and nanotechnology, is supported by the National Science Foundation and other funding agencies. Any opinions, findings, and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the National Science Foundation.