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

Understanding bitonic sorting

Previously we have discussed sorting networks and it closely relates to bitonic sorting, because sorting networks are employed to implement non-adaptive sorting algorithms, for example, bitonic sort. In bitonic sorting, we basically have an input (defined elsewhere) that's a bitonic sequence. A bitonic sequence is one that monotonically increases (decreases), reaches a single maximum (minimum), and then monotonically decreases (increases). A sequence is considered bitonic if it can be made so by cyclically shifting the sequence.

In general, we consider a few scenarios for determining whether the input is suitable for sorting (after all processor cycles are precious and it is a good idea not to waste them doing needless ...

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