Chapter 11. Reduction and sorting
- Implementing parallel processing tasks with MapReduce and OpenCL
- Sorting data with the bitonic sort and radix sort algorithms
At long last, we’re going to stop talking about OpenCL’s structures and functions and start putting them to use. In particular, this chapter focuses on three practical applications of OpenCL: MapReduce, the bitonic sort, and the radix sort. These applications all use a divide-and-conquer methodology to process data in parallel, and they partition data so that each parallel process can operate independently.
The goal of MapReduce isn’t to solve a particular problem, but to provide a framework for solving a class of problems that involve distributed processing. ...
Get OpenCL in Action now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
