Part 2. Coding practical algorithms in OpenCL

Part 2 shows how OpenCL can be used to build applications that process vast amounts of data. Chapter 11 discusses OpenCL implementations of MapReduce, the bitonic sort, and the radix sort. Chapters 12 and 13 focus on matrix operations, including both dense matrices and sparse matrices. Chapter 14 explains how the fast Fourier transform (FFT) can be coded in OpenCL.

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.