A Sorting Library for FPGA Implementation in OpenCL Programming

Kobayashi, Ryohei; Miura, Kento; Fujita, Norihisa; Boku, Taisuke; Amagasa, Toshiyuki

doi:10.1145/3468044.3468054

Cited by 2 publications

(2 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Based on the background, we have introduced a sorting library that can be used with the OpenCL programming model for FPGA [3]. Sorting is a basic arithmetic operation used in the development of various applications, and to accommodate its wide range of uses, libraries are provided in the form of std::sort() for C++ and thrust::sort() for CUDA.…”

Section: Introductionmentioning

confidence: 99%

“…In this paper, we describe in detail the specifications of the sorting library, which could not be described in Ref. [3] due to space limitations, and propose a sorting method for floating-point data as a difference from our previous work. We evaluated the performance of our proposed sorting library for floating-point data and show that it can achieve the same performance as integer types with only a small amount of hardware resource consumption.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

An Open-source FPGA Library for Data Sorting

Kobayashi

Miura

Fujita

et al. 2022

Journal of Information Processing

View full text Add to dashboard Cite

Field-programmable gate arrays (FPGAs) have garnered significant interest in research on highperformance computing because their flexibility enables the building of application-specific computation pipelines and data supply systems. In addition to the flexibility, toolchains for the development of FPGAs in OpenCL have been developed and offered by FPGA vendors that reduce the programming effort required. However, the high level of abstraction in the OpenCL-based development approach is a disadvantage, making it difficult to perform fine-grained performance tuning. In this paper, we present one of the methodologies to achieve both the reduction of FPGA programming cost and the provision of high performance. We focus on data sorting, which is a basic arithmetic operation, and we introduce a sorting library that can be used with the OpenCL programming model for FPGAs. Our sorting library has so far only supported integer data, but in this paper, we propose a new method that supports floating-point data. It consumes at least twice as many hardware resources compared to the merge sort restructured for the OpenCL programming model for FPGAs. However, its operating frequency is 1.08x higher and its sorting throughput is three orders of magnitude greater than the baseline. The source code of our sorting library is open source, and it can be used by application developers around the world.

show abstract

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%