Skip to Main Content
Programming Massively Parallel Processors, 3rd Edition
book

Programming Massively Parallel Processors, 3rd Edition

by David B. Kirk, Wen-mei W. Hwu
November 2016
Intermediate to advanced content levelIntermediate to advanced
576 pages
18h 22m
English
Morgan Kaufmann
Content preview from Programming Massively Parallel Processors, 3rd Edition
Chapter 8

Parallel patterns: prefix sum

An introduction to work efficiency in parallel algorithms

Li-Wen Chang and Juan Gómez-Luna

Abstract

This chapter introduces parallel scan (prefix-sum), an important parallel computation pattern and the concept of work-efficiency for parallel algorithms. It introduces three styles of kernels: Kogge-Stone, Brent-Kung, and two-phase hybrid. Each of these kernels presents a different tradeoff in terms of work-efficiency, speed, and complexity. The chapter then introduces two hierarchical parallel scan algorithms that are designed to process arbitrarily long input lists while maintaining work efficiency.

Keywords

Scan; prefix sum; reduction; work efficiency; linear recurrence; Kogge–Stone; Brent–Kung; hierarchical ...

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

Programming Massively Parallel Processors, 4th Edition

Programming Massively Parallel Processors, 4th Edition

Wen-mei W. Hwu, David B. Kirk, Izzat El Hajj
Engineering a Compiler, 2nd Edition

Engineering a Compiler, 2nd Edition

Keith D. Cooper, Linda Torczon
Algorithms, 4th Edition

Algorithms, 4th Edition

Robert Sedgewick, Kevin Wayne

Publisher Resources

ISBN: 9780128119877