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 12

Parallel patterns: graph search

Juan Gómez-Luna and Izzat El Hajj

Abstract

This chapter presents the parallel graph search pattern. Since graph search computation is about examining the vertex values, there is very little computation on these values once they are loaded from memory. As a result, the speed of graph search is typically limited by memory bandwidth. This chapter presents a graph data format similar to the CSR storage format for sparse matrix that helps minimize the consumption of memory bandwidth. We then introduce work queues, an important class of parallel data structures that supports work-efficient iterative algorithms that require dynamic discovery and collection of the data to be processed. We will show that the privatization ...

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