scaleable sorter for solving huge problems at high performance up to the GB range in linear
time complexity. It will be proven that a combination of a FIFO-based merge sorter and a tree-
based merge sorter results in the best performance at low cost. Moreover, we will
demonstrate how partial run-time reconfiguration can be used for saving almost half the
FPGA resources or alternatively for improving the speed. Experiments show a sustainable …