The reviewed record of science sign in
Pith

arxiv: 2205.07991 · v1 · pith:Z2WIQBII · submitted 2022-05-16 · cs.AR · cs.DC

TopSort: A High-Performance Two-Phase Sorting Accelerator Optimized on HBM-based FPGAs

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:Z2WIQBIIrecord.jsonopen to challenge →

classification cs.AR cs.DC
keywords topsortbandwidthsortingphasefpgasmergeperformanceutilize
0
0 comments X
read the original abstract

The emergence of high-bandwidth memory (HBM) brings new opportunities to boost the performance of sorting acceleration on FPGAs, which was conventionally bounded by the available off-chip memory bandwidth. However, it is nontrivial for designers to fully utilize this immense bandwidth. First, the existing sorter designs cannot be directly scaled at the increasing rate of available off-chip bandwidth, as the required on-chip resource usage grows at a much faster rate and would bound the sorting performance in turn. Second, designers need an in-depth understanding of HBM characteristics to effectively utilize the HBM bandwidth. To tackle these challenges, we present TopSort, a novel two-phase sorting solution optimized for HBM-based FPGAs. In the first phase, 16 merge trees work in parallel to fully utilize 32 HBM channels. In the second phase, TopSort reuses the logic from phase one to form a wider merge tree to merge the partially sorted results from phase one. TopSort also adopts HBM-specific optimizations to reduce resource overhead and improve bandwidth utilization. TopSort can sort up to 4 GB data using all 32 HBM channels, with an overall sorting performance of 15.6 GB/s. TopSort is 6.7x and 2.2x faster than state-of-the-art CPU and FPGA sorters.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.