The Community for Technology Leaders
2016 IEEE 24th Annual International Symposium on Field-Programmable Custom Computing Machines (FCCM) (2016)
Washington, DC, USA
May 1, 2016 to May 3, 2016
ISBN: 978-1-5090-2357-8
pp: 95-102
ABSTRACT
Sorting has tremendous usage in the applications that handle massive amount of data. Existing techniques accelerate sorting using multiprocessors or GPGPUs where a data set is partitioned into disjunctive subsets to allow multiple sorting threads working in parallel. Hardware sorters implemented in FPGAs have the potential of providing high-speed and low-energy solutions but the partition algorithms used in software systems are so data dependent that they cannot be easily adopted. The speed of most current sequential sorters still hangs around 1 number/cycle. Recently a new hardware merge sorter broke this speed limit by merging a large number of sorted sequences at a speed proportional to the number of sequences. This paper significantly improves its area and speed scalability by allowing stalls and variable sorting rate. A 32-port parallel merge-tree that merges 32 sequences is implemented in a Virtex-7 FPGA. It merges sequences at an average rate of 31.05 number/cycle and reduces the total sorting time by 160 times compared with traditional sequential sorters.
INDEX TERMS
Sorting, Hardware, Corporate acquisitions, Field programmable gate arrays, Servers, Software, Bandwidth,FPGA, Merge sort, sorting network, parallel sorting
CITATION
Wei Song, Dirk Koch, Mikel Lujan, Jim Garside, "Parallel Hardware Merge Sorter", 2016 IEEE 24th Annual International Symposium on Field-Programmable Custom Computing Machines (FCCM), vol. 00, no. , pp. 95-102, 2016, doi:10.1109/FCCM.2016.34
102 ms
(Ver 3.3 (11022016))