A Sorting Library for FPGA Implementation in OpenCL Programming

In this paper, we focus on data sorting which is one of the basic arithmetic operations and present a sorting library that can be used with the OpenCL programming model for FPGA Our sorting library is built by combining the three hardware sorting algorithms. It consumes more than twice the overall hardware resources compared to a merge sort restructured for the OpenCL programming model for FPGA, but it should be noticed that its operating frequency is 1.09x higher and its sorting throughput is three orders of magnitude better than the baseline.