O'Reilly logo

OpenCL Parallel Programming Development Cookbook by Raymond Tay

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

Developing the Radix sort in OpenCL

From this section onwards, we are going to develop this sorting method for OpenCL. We are going to do two things: implement the parallel Radix sort described in the paper that Marco Zagha and Guy E. Blelloch wrote in 1991 titled Radix Sort for Vector Multiprocessors. The former algorithm was crafted for the CRAY Y-MP computer (which, in turn, was adapted from the parallel Radix sort algorithm that worked on the Connection Machine (CM-2)).

Getting ready

Radix sorting attempts to treat keys as multi-digit numbers, where each digit is an integer depending on the size of the Radix, R. An example would be sorting a large array of 32-bit numbers. We can see that each such number is made up of four bytes (each byte is ...

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required