Sorting Using Bitonic Network with CUDA

Novel “Manycore” architectures, such as graphics processors, are high-parallel and high-performance shared-memory architectures born to solve specific problems such as the graphical ones. Those architectures can be exploited to solve a wider range of problems by designing the related algorithm for such architectures. The authors present a fast sorting algorithm implementing an efficient bitonic sorting network. This algorithm is highly suitable for information retrieval applications. Sorting is a fundamental and universal problem in computer science. Even if sort has been extensively addressed by many research works, it still remains an interesting challenge to make it faster by exploiting novel technologies.

Resource Details

Provided by:
RWTH Aachen University