Skip to Main Content
GPU Gems 3
book

GPU Gems 3

by Hubert Nguyen
August 2007
Intermediate to advanced content levelIntermediate to advanced
1008 pages
21h 13m
English
Addison-Wesley Professional
Content preview from GPU Gems 3

Chapter 39. Parallel Prefix Sum (Scan) with CUDA

Mark Harris NVIDIA Corporation

Shubhabrata Sengupta University of California, Davis

John D. Owens University of California, Davis

Introduction

A simple and common parallel algorithm building block is the all-prefix-sums operation. In this chapter, we define and illustrate the operation, and we discuss in detail its efficient implementation using NVIDIA CUDA. Blelloch (1990) describes all-prefix-sums as a good example of a computation that seems inherently sequential, but for which there is an efficient parallel algorithm. He defines the all-prefix-sums operation as follows:

The all-prefix-sums operation takes a binary associative operator ⊕ with identity I, and an array of n elements

[a0, a1,..., an

Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

GPU Computing Gems Emerald Edition

GPU Computing Gems Emerald Edition

Wen-mei W. Hwu
GPU PRO 3

GPU PRO 3

Wolfgang Engel

Publisher Resources

ISBN: 9780321545428Purchase book